Azarbaijan Shahid Madani University Communications in Combinatorics and Optimization 2538-2128 9 4 2024 12 01 Characterization of product cordial dragon graphs 805 811 14610 10.22049/cco.2023.27882.1384 EN Mukti Acharya Department of Mathematics, Christ University, Bangalore, India Joseph Varghese Kureethara Department of Mathematics, Christ University, Bangalore, India Journal Article 2022 06 14 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. https://comb-opt.azaruniv.ac.ir/article_14610_8f0bd25d71ecd6d470e4d4bc008f946c.pdf