Hits :

First Author : Dong Chena

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2007-01-01

Document Type : 期刊

Journal : Discrete Applied Mathematics

Volume: Vol.155

Issue : NO.18

Page Number : 2585-2593

Translation or Not : no

Key Words : (2,1)-total;labelling;outerplanar;graph;maximum;degree

Abstract : The (2,1)-total labelling number  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