L(2,1)-labeling of flower snark and related graphs

摘要：

　　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.

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

作者: Tong Chunling Lin Xiaohui Yang Yuansheng Hou Zhengwei

作者单位: College of Information Science and Electricity Engineering,Shandong Jiaotong University,250023 Jinan College of Computer Science and Engineering,Dalian University of Technology Dalian,116024,P.R.China

会议类型: 国内会议

会议名称: 2014全国理论计算机科学学术年会

会议地点: 济南

会议语种:英文

页码: 1-8

在线出版日期: 2014-10-16（万方平台首次上网日期，不代表论文的发表时间）