Some Results on Prime and k-Prime Labeling

S K Vaidya, U M Prajapati


A graph G = (V; E) with n vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not exceeding n such that the labels of each pair of adjacent vertices are relatively prime. A graph G which admits prime labeling is called a prime graph. In the present work we investigate some classes of graphs which admit prime labeling. We also introduce the concept of k-prime labeling and investigate some results concern to it. This work is a nice combination of graph theory and elementary number theory.

Full Text:



Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the '' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.