Characterization of Product Cordial Dragon Graphs

Document Type : Original paper


1 Department of mathematics, Christ University, Bangalore India.

2 Christ University


The vertices of a graph are to be labelled with 0 or 1 such that each edge gets the label as the product of its end vertices. If the number of vertices labelled with 0's and 1's differ by at most one and if the number of edges labelled with 0's and 1's differ by at most by one, then the labelling is called product cordial labelling. Complete characterizations of product cordial dragon graphs are given. We also characterize dragon graphs whose line graphs are product cordial.


Main Subjects

[1] I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combin. 23 (1987), 201–207.
[2] M. Sundaram, R. Ponraj, and S. Somasundaram, Product cordial labeling of graphs, Bull. Pure Appl. Sci. 23E (2004), no. 1, 155–163.