Keywords:-
Article Content:-
Abstract
A prime cordial labeling of a graph G with the vertex set V(G) is a bijection f: V(G)→{1, 2, 3, ............... │V(G)│} 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 atmost 1. A graph which admits a prime cordial labeling is called a prime cordial graph. In this paper we prove that Y-tree and X-tree are prime cordial.
References:-
References
S.Babitha and J.Baskar Babujee, Prime cordial labeling on graphs, International Journal of
Mathematical Sciences, 7 (1) (2013), 43-48.
S. Babitha and J. Baskar Babujee, Prime cordial labeling and dulity, Advances and Applications
in Discrete Mathematics, 11 (1) (2013) , 79-102.
L. W. Beineke and S. M. Hegde, Strongly Multiplicative graphs, Discuss. Math. Graph
Theory, 21(2001), 63-75.
Bondy J.A and Murthy USR, Graph theory and applications (North - Holland) New York
(1976).
J.A. Gallian - A dynamic survey of graph lebeling, Electronic Journal of Combinatorics 16
(2013) ≠ DS6.
M. Sundaram, R. Ponraj and Somasundaram Prime cordial labeling of graphs, J. Indian
Acad. Math 27 (2) (2005), 373-390.
A Tout, A.N.Dabboney and H.Howalla Prime labeling of graphs, Nat Acad Sci. Letters 11
(1982), 365-368.
S. K. Vaidya and P. L. Vihol, Prime cordial labeling for some cycle related graphs, Int. J. of
Open Problems in Computer Science and Mathematics, 3(5) (2010), 223-232.
S. K. Vaidya and P. L. Vihol, Prime cordial labeling for some graphs, Modern Applied
Science, 4(8)(2010), 119-126.
S. K. Vaidya and N. H. Shah, Some New Families of Prime Cordial Graphs, J. of Mathematics
Research, 3(4)(2011), 21-30.
S. K. Vaidya and N. H. Shah, Prime Cordial Labeling of Some Graphs, Open Journal of
Discrete Mathematics, 2(2012), 11-16.
S. K. Vaidya and N. H. Shah, Prime cordial labeling of some wheel related graphs, Malaya
Journal of Matematik, 4 (1) (2013), 148 - 156.
S.K.Vaidya and U.M.Prajapati, Some New Results on Prime Graphs, Open Journal of
Discrete Mathematics, 2 (3) (2012), 99-104.
S.K.Vaidya and U.M.Prajapati, Some Switching Invariant Prime Graphs, Open Journal of
Discrete Mathematics, 2 (1) (2012), 17-20.
S.K.Vaidya and U.M.Prajapati, Prime Labeling in the context of duplication of graph
elements, International Journal of Mathematics and Soft Computing,
(1) (2013), 13-20.
V. Yegnanaryanan and P. Vaidhyanathan, Some Interesting Applications of Graph
Labellings, J. Math. Comput. Sci., 2(5) (2012), 1522-1531.