Broader families of cordial graphs
<p>A binary labeling of the vertices of a graph <em>G</em> 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.</p>
1967 ◽
Vol 25
◽
pp. 312-313
1991 ◽
Vol 49
◽
pp. 374-375
Keyword(s):
1968 ◽
Vol 26
◽
pp. 334-335
◽
Keyword(s):
1992 ◽
Vol 50
(2)
◽
pp. 1204-1205
1992 ◽
Vol 50
(2)
◽
pp. 1170-1171