Hits:

Indexed by:期刊论文

Date of Publication:2013-07-01

Journal:ARS COMBINATORIA

Included Journals:SCIE、Scopus

Volume:110

Page Number:505-512

ISSN No.:0381-7032

Key Words:L(2,1)-labeling; L(2,1)-labeling number; Flower snark

Abstract: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.