Generalized books and Cm-snakes are prime graphs

被引：0

作者：

Carlson, Kelli

机构：

来源：

ARS COMBINATORIA | 2006年 / 80卷

关键词：

prime labeling; prime graph;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph G on n vertices has a prime labeling if its vertices can be assigned the distinct labels 1, 2,..., n such that for every edge xy in G, the labels of x and y are relatively prime. In this paper, we show that generalized books and C-m snakes all have prime labelings. In the process, we demonstrate a way to build new prime graphs from old ones.

引用

页码：215 / 221

页数：7