论文部分内容阅读
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,λ(G),is the minimum range of labels over all such labelings.In this paper,we determine the λ-numbers of flower snark and its related graphs for all n≥3.