王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

Adjacent vertex distinguishing indices of planar graphs without 3-cycles

Hits :

First Author : Danjun Huang

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

Date of Publication : 2015-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.338

Issue : No.3

Page Number : 139-148

ISSN : 0012-365X

Translation or Not : no

Key Words : Adjacent;vertex;distinguishing;coloring;Planar;graph;Maximum;degree;Cycle

Abstract : Given a proper edge k -coloring ϕ and a vertex v ∈ V ( G ) , let C ϕ ( v ) denote the set of colors used on edges incident to v with respect to ϕ . The adjacent vertex distinguishing index of G , denoted by χ a ′ ( G ) , is the least value of k such that

Pre One : Equitable total-coloring of subcubic graphs

Next One : Some bounds on the neighbor-distinguishing index of graphs

Recommend this Article