Advances and Applications in Discrete Mathematics
Volume 11, Issue 1, Pages 79 - 102
(January 2013)
|
|
PRIME CORDIAL LABELING AND DUALITY
S. Babitha and J. Baskar Babujee
|
Abstract: A prime cordial labeling of a graph G with vertex set V is a bijection f from V to such that each edge uv is assigned the label 1 if and 0 if then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper, we exhibit prime cordial labeling for some class of cycle related graphs and discuss with duality of prime cordial labeling. |
Keywords and phrases: |
|
Number of Downloads: 235 | Number of Views: 564 |
|