English

(2,1)-Total labeling of planar graphs with large maximum degree

Combinatorics 2011-05-11 v1 Discrete Mathematics

Abstract

The (dd,1)-total labelling of graphs was introduced by Havet and Yu. In this paper, we prove that, for planar graph GG with maximum degree Δ12\Delta\geq12 and d=2d=2, the (2,1)-total labelling number λ2T(G)\lambda_2^T(G) is at most Δ+2\Delta+2.

Keywords

Cite

@article{arxiv.1105.1908,
  title  = {(2,1)-Total labeling of planar graphs with large maximum degree},
  author = {Yong Yu and Xin Zhang and Guanghui Wang and Jinbo Li},
  journal= {arXiv preprint arXiv:1105.1908},
  year   = {2011}
}

Comments

9 pages, 1 figure

R2 v1 2026-06-21T18:05:04.713Z