Release Time:2019-03-09  Hits:

Indexed by: Journal Article

Date of Publication: 2010-07-01

Journal: UTILITAS MATHEMATICA

Included Journals: Scopus、SCIE

Volume: 82

Page Number: 71-79

ISSN: 0315-3681

Key Words: generalized Petersen graph; Prime labeling; Prime cordial; Prime cordial labeling

Abstract: A graph with vertex set V is said to have a prime cordial labeling if there is a bijection f from V to {1, 2,...,vertical bar V vertical bar}. such that if each edge uv is assigned the label 1 for the greatest common divisor gcd(f (u), f(v)) = 1 and 0 for gcd(f (u), f(v)) > 1 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 show that generalized Petersen graph P(n, k) is prime cordial for all n and k except P(4, 1).