Keywords:-
Article Content:-
Abstract
A Graph G 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 this paper we investigate prime labeling of some graphs related to helm Gear graph , Crown and star . We discuss prime labeling in the context of graph operation namely duplication.
References:-
References
Bondy.J.A and Murthy. U.S.R, “Graph Theory and Application”.
(North - Holland). Newyork (1976).
Deretsky.T, Lee.S.M and Mitchem.J, “On Vertex Prime Labeling of Graphs in Graph
Theory, Combinatorics and Applications”, Vol. 1 Alavi.J, Chartrand. G, Oellerman.O and
Schwenk. A, eds. Proceedings 6th International Conference Theory and Application of
Graphs (Wiley, New York 1991) 359-369.
Fu. H.C and Huany. K.C. “On Prime Labeling Discrete Math”, 127 (1994) 181-186.
Lee. S. M, Wui.L and Yen.J “On the Amalgamation of Prime Graphs”, Bull. Malaysian
Math. Soc. (Second Series) 11, (1988) 59-67.
Meena.S and K. Vaithilingam “Prime Labeling For Some Helm Related Graphs”,
International Journal of innovative research in Science, Engineering and Technology, Vol.2,
April 2009.
Sundaram M.Ponraj & Somasundaram. S. (2006) “On Prime Labeling Conjecture”, Ars
Combinatoria, 79, 205-209.
Tout. A, Dabboucy.A.N and Howalla. K, “Prime Labeling of Graphs”, Nat. Acad. Sci letters
(1982)365-368 Combinatories and Application Vol.1 Alari.J(Wiley.N.Y 1991) 299-359.
Vaidya. S.K and Kanmani. K.K, “Prime Labeling for some Cycle Related Graphs”, Journals
of Mathematics Research vol.2. No.2. May 2010 (98-104).