点击次数：

论文类型：期刊论文

发表时间：2010-07-01

发表刊物：UTILITAS MATHEMATICA

收录刊物：SCIE、Scopus

卷号：82

页面范围：71-79

ISSN号：0315-3681

关键字：generalized Petersen graph; Prime labeling; Prime cordial; Prime cordial labeling

摘要：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).