Hits :

First Author : Huang, Danjun

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

Date of Publication : 2012-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.312

Issue : No.24

Page Number : 3544-3546

ISSN : 0012-365X

Translation or Not : no

Key Words : Adjacent;vertex;distinguishing;total;coloring;Maximum;degree

Abstract : An adjacent vertex distinguishing total coloring of a graph is a proper total coloring of such that any pair of adjacent vertices have different sets of colors. The minimum number of colors needed for such a total coloring of is denoted by . In this note,