International Journal of Mathematics Trends and Technology
Volume 58 | Number 3 | Year 2018 | Article Id. IJMTT-V58P521 | DOI : https://doi.org/10.14445/22315373/IJMTT-V58P521
For any abelian group A , a graph G is said to be A -
cordial if there is a labeling f of V (G) with elements of A so that for all
a,b Î A , the edge ab is
labeled with f (a) + f
(b) then the number of vertices labeled with a and the vertices labeled with b
differ by at most 1and the number of edges labeled with a and edges labeled
with b differ by at most 1. In this paper we determine some classes of Z2 ´Z2 cordial graphs, a
necessary condition for the sum of two Z2
´Z2 - cordial graphs to
be Z2 ´Z2 - cordial and we
prove that every graph is an induced sub graph of Z2 ´Z2 - cordial graph.
[1] Mark Hovey, A – cordial Graphs, Discrete mathematics 93(1991) 183 – 194, North Holland.
[2] O.Pechenik and J. Wise, Generalized graph cordialty, Discuss. Math. Graph Theory 32 (2012) 557-567.
[3] WB West, Introduction to Graph Theory, (2nd Edn) Pearson Education (2001)
[4] Joseph A Gallian, A Dynamic Survey of Graph Labeling, 19th Edn, December 23, 2016.
S. Beena, "On Z 2 x Z 2 - Cordial Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 58, no. 3, pp. 150-154, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V58P521
PDF 
Abstract 
Keywords 
References 
Citation