王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

[formula omitted]-total labeling of trees with large maximum degree.

Hits :

First Author : Chen, Dong

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

Date of Publication : 2015-01-01

Document Type : 期刊

Journal : Discrete Applied Mathematics

Volume: Vol.187

Page Number : 61-69

ISSN : 0166-218X

Translation or Not : no

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

Abstract : A k -(2, 1)-total labeling of a graph G is to label the vertices and the edges of G using integers from 0 to k such that all adjacent vertices as well as edges receive different labels, and the difference between the labels of a vertex and its incident ed

Pre One : PLANAR GRAPHS WITH Δ ≥ 9 ARE ENTIRELY (Δ + 2)-COLORABLE.

Next One : Acyclic Edge Coloring of 4-Regular Graphs Without 3-Cycles

Recommend this Article