Title of article
Characterization of product cordial dragon graphs
Author/Authors
Acharya ، Mukti Department of Mathematics - Christ University , Kureethara ، Joseph Varghese Department of Mathematics - Christ University
From page
805
To page
811
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
Cordial graph , Binary labeling , Line graph , Dragon graph
Journal title
Communications in Combinatorics and Optimization
Journal title
Communications in Combinatorics and Optimization
Record number
2762252
Link To Document