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

preprint2011arXivOpen access

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Δ\geq12 and d=2d=2, the (2,1)-total labelling number λ2T(G)λ_2^T(G) is at most Δ+2Δ+2.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.