Published September 7, 2016 | Version v1

ON PRIME LABELING OF HERSCHEL GRAPH

  • 1. Assistant Professor of Mathematics, T.K Government Arts College, Vriddhachalam, Tamilnadu
  • 2. Associate Professor of Mathematics, Government Arts College, Thiruvannamalai, Tamilnadu

Description

A graph  with vertex set  is said to have a prime labeling if its vertices are labeled with distinct integers  such that for each  the labels assigned to  and  are relatively prime.  A graph which admits prime labeling is called a prime graph.In this paper, we investigate prime labeling of Herschel graph.  We also discuss prime labeling in the context of some graph operations namely Fusion, Duplication, Switching and Path union

Files

104.pdf

Files (960.4 kB)

Name Size Download all
md5:aabe504e5c39b7b7e9da0dd296948634
960.4 kB Preview Download

Additional details

References

  • 1. J. A. Bondyand U.S.R. Murthy, “Graph Theory and Applications”, (North-Holland).New York (1976).
  • 2. A. Tout, A.N. Dabboucy and K. Howalla, “Prime labeling of graphs”, Nat.Acad.Sci. Letters, 11 (1982) 365-368.
  • 3. S. M. Lee, L. Wui, and J. Yen, “on the amalgamation of prime graphs Bull”, MalaysianMath.Soc. (Second Series)11, (1988) 59-67.
  • 4. T. O. Dretskyetal, “on Vertex Prime labeling of graphs in graph theory”, Combinatories and applications, Vol. 1, J. Alari (Wiley. N.Y.1991) 299-359.
  • 5. H. C. Fuand K.C. Huany, “on prime labeling Discrete Math”, 127, (1994) 181-186.
  • 6. M. Sundaram, R. Ponraj& S. Somasundaram (2006), “on prime labeling conjecture”, Ars Combinatoria 79 205-209.
  • 7. J.A. Gallian, “A dynamic survey of graph labeling”, The Electronic Journal of Combinations 16 #DS6 (2009).
  • 8. S.K. Vaidya and K. K. Kanmani, “Prime labeling for some cycle related graphs”, journal of Mathematics Research, Vol.2. No.2, May(2010) 98-104.
  • 9. S. Meena and K. Vaithilingam, “Prime Labeling for some Helm related graphs”, International journal of Innovative Research in Science, Engineering and Technology Vol.2,issue 4, (2013).