Some Characterizations and NP-Complete Problems for Power Cordial Graphs

C. M. Barasara, Y. B. Thakkar and Akbar Ali

Journal of Mathematics, 2023, vol. 2023, 1-5

Abstract: A power cordial labeling of a graph G=VG,EG is a bijection f:VG⟶1,2,…,VG such that an edge e=uv is assigned the label 1 if fu=fvn or fv=fun, for some n∈N∪0 and the label 0 otherwise, and satisfy the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. The graph that admits power cordial labeling is called a power cordial graph. In this paper, we derive some characterizations of power cordial graphs as well as explore NP-complete problems for power cordial labeling. This work also rules out any possibility of forbidden subgraph characterization for power cordial labeling.

Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2023/2257492.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2023/2257492.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:2257492

DOI: 10.1155/2023/2257492

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().