A note on the adjacent vertex distinguishing total chromatic number of graph

被引：0
|
作者：
Wang, Zhiwen [1 ]
机构：
[1] Ningxia Univ, Sch Math & Comp Sci, Ningxia 750021, Yinchuan, Peoples R China
来源：
ADVANCED MATERIALS AND COMPUTER SCIENCE, PTS 1-3 | 2011年 / 474-476卷
关键词：
Series-parallel Graph; Adjacent vertex distinguishing total coloring;
D O I：
10.4028/www.scientific.net/KEM.474-476.2341
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A total coloring of a simple graph G is called adjacent vertex distinguishing if for any two adjacent and distinct vertices u and v in G, the set of colors assigned to the vertices and the edges incident to u differs from the set of colors assigned to the vertices and the edges incident to v. In this paper we shall prove the series-parallel graph with maximum degree 3 and the series-parallel graph whose the number of edges is the double of maximum degree minus 1 satisfy the adjacent vertex distinguishing total coloring conjecture.
引用
收藏
页码：2341 / 2345
页数：5
相关论文
共 50 条
  • [41] Adjacent vertex distinguishing total coloring of corona products
    Furmanczyk, Hanna
    Zuazua, Rita
    [J]. XII LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, LAGOS 2023, 2023, 224 : 382 - 384
  • [42] Adjacent vertex distinguishing total colorings of outerplanar graphs
    Wang, Yiqiao
    Wang, Weifan
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2010, 19 (02) : 123 - 133
  • [43] On adjacent-vertex-distinguishing total coloring of graphs
    Zhongfu Zhang
    Xiang’en Chen
    Jingwen Li
    Bing Yao
    Xinzhong Lu
    Jianfang Wang
    [J]. Science in China Series A: Mathematics, 2005, 48 : 289 - 299
  • [44] On adjacent-vertex-distinguishing total coloring of graphs
    ZHANG Zhongfu
    Department of Computer
    Institute of Applied Mathematics
    College of Information and Electrical Engineering
    [J]. Science China Mathematics, 2005, (03) : 289 - 299
  • [45] On adjacent-vertex-distinguishing total coloring of graphs
    Zhang, ZF
    Chen, XE
    Li, JW
    Yao, B
    Lu, XZ
    Wang, JF
    [J]. SCIENCE IN CHINA SERIES A-MATHEMATICS, 2005, 48 (03): : 289 - 299
  • [46] The adjacent vertex distinguishing total coloring of planar graphs
    Wang, Weifan
    Huang, Danjun
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (02) : 379 - 396
  • [47] On adjacent-vertex-distinguishing total coloring of graphs
    ZHANG Zhongfu CHEN Xiangen LI Jingwen YAO Bing LU Xinzhong WANG Jianfang College of Mathematics and Information Science Northwest Normal University Lanzhou China
    Department of Computer Lanzhou Normal College Lanzhou China
    Institute of Applied Mathematics Lanzhou Jiaotong University Lanzhou China
    College of Information and Electrical Engineering Lanzhou Jiaotong University Lanzhou China
    Institute of Applied Mathematics Chinese Academy of Sciences Beijing China
    [J]. Science in China,Ser.A., 2005, Ser.A.2005 (03) - 299
  • [48] On the vertex-distinguishing edge chromatic number of Cm ∨ Cn
    Jingwen, Li
    Baogen, Xu
    Zhang Zhongfu
    [J]. PROCEEDINGS OF THE CHINA ASSOCIATION FOR SCIENCE AND TECHNOLOGY, VOL 4, NO 3, 2008, : 235 - 237
  • [49] Retraction Note to: A study on harmonious chromatic number of total graph of central graph of generalized Petersen graph
    M. S. Franklin Thamil Selvi
    A. Amutha
    [J]. Journal of Ambient Intelligence and Humanized Computing, 2023, 14 (Suppl 1) : 499 - 499
  • [50] ON TOTAL CHROMATIC NUMBER OF OUTERPLANAR GRAPH
    ZHANG, ZF
    ZHANG, JX
    WANG, JF
    [J]. KEXUE TONGBAO, 1987, 32 (17): : 1223 - 1223
12345