World Academy of Science, Engineering and Technology
Published August 5, 2013 | Version 16747
Journal article Open

Prime Cordial Labeling on Graphs

Authors/Creators

Description

A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |} such that each edge uv is assigned the label 1 if gcd(f(u), f(v)) = 1 and 0 if gcd(f(u), f(v)) > 1, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper we exhibit some characterization results and new constructions on prime cordial graphs.

Files

16747.pdf

Files (180.6 kB)

Name Size Download all
md5:1f2d0acbcc5bfece0741b72ecfe2b740
180.6 kB Preview Download

Additional details

References

  • <p>
  • J. Baskar Babujee, Euler's Phi Function and Graph Labeling, Int. J. Contemp. Math. Sciences, 5(20) (2010), 977–984.
  • J. Baskar Babujee and S. Babitha, New Constructions of Edge Bimagic Graphs from Magic Graphs, Applied Mathematics, 2 (2011), 1393–1396.
  • S. Babitha and J. Baskar Babujee, Prime Cordial Labeling and Duality, Israel journal of Mathematics, Communicated.
  • J. Baskar Babujee and L. Shobana, Prime Cordial Labeling, International Review of Pure and Applied Mathematics, 5(2) (2009), 277–282.
  • J. Baskar Babujee and L. Shobana, Prime and Prime Cordial Labeling, Int. J. Contemp. Math. Sciences, 5(47) (2010), 2347–2356.
  • I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combin, 23 (1987), 201–207.
  • J.A. Gallian, A Dynamic Survey of Graph Labeling, Electronic Journal of Combinatorics, 18 (2011), # DS6.
  • Haque, Kh.Md. Mominul, Xiaohui, Lin, Yuansheng, Yang, Pingzhong, Zhao, On the Prime cordial labeling of generalized Petersen graph, Utilitas Mathematica, 82 (2010), 71–79.
  • M. Sundaram, R. Ponraj and S. Somasundram, Prime cordial labeling of graphs, Indian Acad. Math., 27 (2005), 373–390. [10] M. Sundaram, R. Ponraj, and S. Somasundram, Total product cordial labeling of graphs, Bull. Pure Appl. Sci. Sect. E Math. Stat., 25 (2006), 199–203. [11] S.K. Vaidya, N.H. Shah, Some New Families of Prime Cordial Graphs, Journal of Mathematics Research, 3(4) (2011), November. [12] S.K. Vaidya, P.L. Vihol, Prime cordial labeling for some cycle related graphs, Int. J. Open Problems Compt. Math., 3(5) (2010), Dec. [13] D. Wiselet, T. Nicholas, A Linear Model of E-Cordial, Cordial, HCordial and Genuinely Cordial Labellings, International Journal of Algorithms, Computing and Mathematics, 3(4) (2010), November.</p>