点击次数：

论文类型：期刊论文

发表时间：2013-07-01

发表刊物：ARS COMBINATORIA

收录刊物：SCIE、Scopus

卷号：110

页面范围：505-512

ISSN号：0381-7032

关键字：L(2,1)-labeling; L(2,1)-labeling number; Flower snark

摘要：An L(2, 1)-labeling of a graph G is an assignment of nonnegative integers to the vertices of G such that adjacent vertices get numbers at least two apart, and vertices at distance two get distinct numbers. The L(2, 1)-labeling number of G, lambda(G), is the minimum range of labels over all such labelings. In this paper, we determine the lambda-numbers of flower snark and its related graphs for all n >= 3.