Some Characterizations and NP-Complete Problems for Power Cordial Graphs
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2023-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2023/2257492 |