王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

On $(d,1)$-total numbers of graphs.

Hits :

First Author : Lih, Ko-Wei

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

Date of Publication : 2009-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.309

Issue : No.12

Page Number : 3767-3773

Translation or Not : no

Key Words : Channel;assignment;L(2,1)-labelling;(d,;1)-total;labelling;Chromatic;number;Chromatic;index

Abstract : A -total labelling of a graph assigns integers to the vertices and edges of such that adjacent vertices receive distinct labels, adjacent edges receive distinct labels, and a vertex and its incident edges receive labels that differ in absolute value by at

Pre One : (2,1)-Total labelling of outerplanar graphs

Next One : The surviving rate of a graph for the firefighter problem.

Recommend this Article