Contents

Ars Combinatoria

  • Research article

\(L(2,1)\)-Labeling of Flower Snark and Related Graphs

Tong Chunling1, Lin Xiaohui2, Yang Yuansheng2, Hou Zhengwei2
1College of Information Science and Electricity Engineering, Shandong Jiaotong University, 250023 Jinan, P. R. China
2College of Computer Science and Engineering, Dalian University of Technology Dalian, 116024, P. R. China
  • Published: 31/07/2013

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 \geq 3\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Tong Chunling, Lin Xiaohui, Yang Yuansheng, Hou Zhengwei. \(L(2,1)\)-Labeling of Flower Snark and Related Graphs[J], Ars Combinatoria, Volume 110. 505-512. .