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

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

2011-05-10

arxiv.org/abs/1105.1908v1

Mathematics

Combinatorics

9 pages, 1 figure

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

(2,1)-Total labeling of planar graphs with large maximum degree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with (2,1)-Total labeling of planar graphs with large maximum degree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and (2,1)-Total labeling of planar graphs with large maximum degree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-279255