Broader families of cordial graphs

Christian Barrientos, Sarah Minion


A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and the number of vertices labeled 1 differ by at most 1, and the number of edges of weight 0 and the number of edges of weight 1 differ by at most 1. In this paper we present general results involving the cordiality of graphs that results of some well-known operations such as the join, the corona, the one-point union, the splitting graph, and the super subdivision. In addition we show a family of cordial circulant graphs.


cordial, corona, join, splitting, circulant, super submission

Full Text:




M. Andar, S. Boxwala, and N. Limaye, On the cordiality of corona graphs, Ars Combin., 78 (2006), 179--199.

I. Cahit, Cordial graphs: a weaker version of graceful and harmonious graphs, Ars Combin., 23 (1987), 201--207.

I. Cahit, On cordial and 3-equitable labellings of graphs, Util. Math., 37 (1990), 189--198.

G. Chartrand and L. Lesniak, Graphs & Digraphs 2nd ed., Wadsworth & Brooks/Cole (1986).

G. M. Du, Cordiality of complete k-partite graphs and some special graphs, Neimenggu Shida Xuebao Ziran Kexue Hanwen Ban, (1997), 9--12.

J. A. Gallian, A dynamic survey of graph labeling, Electronic J. Combin., 23 (2020) #DS6.

J. L. Gross, J. Yellen, and P. Zhang, Handbook of Graph Theory 2nd ed. CRC Press (2014).

Y. S. Ho, S. M. Lee, and S. C. Shee, Cordial labellings of the Cartesian product and composition of graphs, Ars Combin., 29 (1990), 169--180.

W.W. Kirchherr, On the cordiality of some specific graphs, Ars Combin., 31 (1991), 127--138.

Z. Liu and B. Zhu, A necessary and sufficient condition for a 3-regular graph to be cordial, Ars Combin., 84 (2007), 225--230.

R. C. Read and R. Wilson, An Atlas of Graphs, Oxford University Press (1998).

M. A. Seoud and A. E. I. Abdel Maqsoud, On cordial and balanced labelings of graphs, J. Egyptian Math. Soc., 7 (1999), 127--135.

G. Sethuraman and P. Selvaraju, Gracefulness of arbitrary super subdivisions of graphs, Indian J. Pure Appl. Math., 32 (2001), 1059--1064.

G. Sethuraman and P. Selvaraju, Decompositions of complete graphs and complete bipartite graphs into isomorphic super subdivision graphs, Discrete Math., 260 (2003), 137--149.

M. Z. Youssef, On Skolem-graceful and cordial graphs, Ars Combin., 78 (2006), 167--177.

M. Z. Youssef, Graph operations and cordiality, Ars Combin., 97 (2010), 161--174.


  • There are currently no refbacks.

ISSN: 2541-2205

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View IJC Stats