Characterization of product cordial dragon graphs

Document Type : Short notes

Authors

Department of Mathematics, Christ University, Bangalore, India

Abstract

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.

Keywords

Main Subjects

References

[1] I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combin. 23 (1987), 201–207.
[2] N. Inayah, A. Erfanian, and M. Korivand, Total product and total edge product cordial labelings of dragonfly graph (dgn), J. Math. 2022 (2022), no. 1, Artice ID: 3728344.  https://doi.org/10.1155/2022/3728344
[3] M. Sundaram, R. Ponraj, and S. Somasundaram, Product cordial labeling of graphs, Bull. Pure Appl. Sci. 23E (2004), no. 1, 155–163.
Communications in Combinatorics and Optimization
Volume 9, Issue 4
December 2024
Pages 805-811

Files

Share

How to cite

Statistics