Hits :

First Author : Lianzhu Zhang

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

Date of Publication : 2014-01-01

Document Type : 期刊

Journal : Discrete Applied Mathematics

Volume: Vol.162

Page Number : 348-354

ISSN : 0166-218X

Translation or Not : no

Key Words : Adjacent;vertex;distinguishing;coloring;Maximum;degree;Edge-partition

Abstract : An adjacent vertex distinguishing coloring of a graph G is a proper edge coloring of G such that any pair of adjacent vertices are incident with distinct sets of colors. The minimum number of colors needed for an adjacent vertex distinguishing coloring of