Hits :

First Author : Zhengke Miao

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

Date of Publication : 2016-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.31

Issue : No.2

Page Number : 893-901

ISSN : 1382-6905;1573-2886

Translation or Not : no

Key Words : \((2,;1)\)-Total;labeling;Tree;Maximum;degree

Abstract : The \((2, 1)\)-total labeling number \(\lambda _2^t(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 edg