Characterization of product cordial dragon graphs

Title

Characterization of product cordial dragon graphs

Creator

Acharya M.; Kureethara J.V.

Description

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 is given. We also characterize dragon graphs whose line graphs are product cordial. 2024 Azarbaijan Shahid Madani University.

Source

Communications in Combinatorics and Optimization, Vol-9, No. 4, pp. 805-811.

Date

2024-01-01

Publisher

Azarbaijan Shahid Madani University

Subject

Binary labeling; Cordial graph; Dragon graph; Line graph

Coverage

Acharya M., Department of Mathematics, Christ University, Bangalore, India; Kureethara J.V., Department of Mathematics, Christ University, Bangalore, India

Rights

Restricted Access

Relation

ISSN: 25382128

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.22049/CCO.2023.27882.1384

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85199493132&doi=10.22049%2fCCO.2023.27882.1384&partnerID=40&md5=b947b45a3f7dcd0a20fb166b3bb9ab97