The Adjacent Vertex Distinguishing Total Chromatic Number of Graphs

被引：0

作者：

Wang, Zhiwen ^{[1
]}

Zhu, Enqiang ^{[2
]}

机构：

[1] Ningxia Univ, Sch Math & Comp Sci, Yinchuan 750021, Peoples R China

[2] Lanzhou Jiaotong Univ, Inst Appl Math, Lanzhou 730070, Peoples R China

来源：

2010 4TH INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICAL ENGINEERING (ICBBE 2010) | 2010年

关键词：

Adjacent vertex-distinguishing total coloring; Adjacent vertex-distinguishing total chromatic number; complete graph; COLORINGS;

D O I：

暂无

中图分类号：

R318 [生物医学工程];

学科分类号：

0831 ;

摘要：

Let G = (V, E) be a graph and f:(V U E) -> [k] be a proper total k-coloring of G.We say that f is an adjacent vertex distinguishing total coloring if for any two adjacent vertices,the set of colors appearing on the vertex and incident edges are different. We call the smallest k for which such a coloring of G exists the adjacent vertex distinguishing total chromatic number,and denote it by x(at)(G). In this paper,we show that Xat (K-19- E(C-4)) = 20 and xat (K-21-E(C-4)) - 22.

引用

页数：3

共 10 条

[1] Vertex distinguishing colorings of graphs with Δ (G)=2 [J].

Balister, PN ;

Bollobás, B ;

Schelp, RH .

DISCRETE MATHEMATICS, 2002, 252 (1-3) :17-29

[2] On the vertex-distinguishing proper edge-colorings of graphs [J].

Bazgan, C ;

Harkat-Benhamdine, A ;

Li, H ;

Wozniak, M .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1999, 75 (02) :288-301

[3]

Burris AC, 1997, J GRAPH THEOR, V26, P73, DOI 10.1002/(SICI)1097-0118(199710)26:2<73::AID-JGT2>3.0.CO

[4]

2-C

[5] On the adjacent vertex distinguishing total coloring numbers of graphs with Δ=3 [J].

Chen, Xiang'en .

DISCRETE MATHEMATICS, 2008, 308 (17) :4003-4007

[6]

[陈祥恩 Chen Xiangen], 2005, [兰州大学学报. 自然科学版, Journal of Lanzhou University. Natural Science], V41, P102

[7] Concise proofs for adjacent vertex-distinguishing total colorings [J].

Hulgan, Jonathan .

DISCRETE MATHEMATICS, 2009, 309 (08) :2548-2550

[8] On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ(G)=3 [J].

Wang, Haiying .

JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 14 (01) :87-109

[9] On adjacent-vertex-distinguishing total coloring of graphs [J].

Zhang, ZF ;

Chen, XE ;

Li, JW ;

Yao, B ;

Lu, XZ ;

Wang, JF .

SCIENCE IN CHINA SERIES A-MATHEMATICS, 2005, 48 (03) :289-299

[10] Adjacent strong edge coloring of graphs [J].

Zhang, ZF ;

Liu, LZ ;

Wang, JF .

APPLIED MATHEMATICS LETTERS, 2002, 15 (05) :623-626

← 1 →