点击次数：

论文类型：期刊论文

发表时间：2013-04-01

发表刊物：ARS COMBINATORIA

收录刊物：SCIE、Scopus

卷号：109

页面范围：113-128

ISSN号：0381-7032

关键字：Prime labeling; Prime graph; Knodel graph

摘要：A graph G with vertex set V is said to have a prime labeling if its vertices can be labeled with distinct integers 1, 2, . . . , vertical bar V vertical bar such that for every edge xy in E, the labels assigned to x and y are relatively prime or coprime. In this paper, we show that the Knodel graph W-3,W-n is prime for n <= 130.