Can I read (2,1)-Total labelling of outerplanar graphs on EtoBox?

(2,1)-Total labelling of outerplanar graphs by Dong Chen; Weifan Wang is a Computer Science article available to read on EtoBox.

What is (2,1)-Total labelling of outerplanar graphs about?

The (2, 1)-total labelling number T 2 (G) of a graph G is the width of the smallest range of integers that suffices to label the vertices and the edges of G such that no two adjacent vertices have the same label, no two adjacent edges have the same label and the difference between the labels of a vertex and its incident edges is at least 2. In this paper we prove that if G is an outerplanar graph with maximum degree (G), G) = 4 and G contains no intersecting triangles.

Who reads (2,1)-Total labelling of outerplanar graphs?

Author

Dong Chen; Weifan Wang

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)

Published

2007

Language

EN

Field

Computer Science (Physical Sciences)