PRIME LABELING IN THE CONTEXT OF DUPLICATION OF VERTICES
Main 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 the existence of prime labeling of some graphs related to cycle  , wheel  ,Gear graph  ,Friendship graph  and Double triangular snake  . We discuss prime labeling in the context of the graph operation namely duplication.
Keywords: Graph Labeling, Prime Labeling, Duplication, Prime Graphs.
Downloads
Article Details
References
Bondy.J.A and Murthy. U.S.R, “Graph Theory and its 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.
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 letters11 (1982)365-368 Combinatorics and Application Vol.1Alari.J(Wiley.N.Y 1991) 299-359.
Vaidya S.K and Kanmani k.k, “Prime Labeling for Some Cycle Related Graphsâ€, Journal of Mathematics Research, vol.2. No.2 may 2010 (98 – 104).