Upper bounds on vertex distinguishing chromatic index of some Halin graphs

被引：0
|
作者：
ZHU Junqiao BU Yuehua Xingzhi College Zhejiang Normal University Jinhua China College of Mathematics Physics and Information Engineering Zhejiang Normal University Jinhua China [1 ,2 ,1 ,321004 ,2 ,321004 ]
机构：
来源：
AppliedMathematics:AJournalofChineseUniversities(SeriesB) | 2012年 / 27卷 / 03期
关键词：
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
摘要：
A vertex distinguishing edge coloring of a graph G is a proper edge coloring of G such that any pair of vertices has the distinct sets of colors. The minimum number of colors required for a vertex distinguishing edge coloring of a graph G is denoted by χ s′ (G). In this paper, we obtained upper bounds on the vertex distinguishing chromatic index of 3-regular Halin graphs and Halin graphs with △(G) ≥ 4, respectively.
引用
收藏
页码：329 / 334
页数：6
相关论文
共 50 条
  • [1] Upper bounds on vertex distinguishing chromatic index of some Halin graphs
    Zhu Jun-qiao
    Bu Yue-hua
    APPLIED MATHEMATICS-A JOURNAL OF CHINESE UNIVERSITIES SERIES B, 2012, 27 (03) : 329 - 334
  • [2] Upper bounds on vertex distinguishing chromatic index of some Halin graphs
    ZHU Jun-qiao 1 BU Yue-hua 2
    Applied Mathematics:A Journal of Chinese Universities, 2012, (03) : 329 - 334
  • [3] Upper bounds on vertex distinguishing chromatic index of some Halin graphs
    Jun-qiao Zhu
    Yue-hua Bu
    Applied Mathematics-A Journal of Chinese Universities, 2012, 27 : 329 - 334
  • [4] UPPER BOUNDS FOR THE STRONG CHROMATIC INDEX OF HALIN GRAPHS
    Hu, Ziyu
    Lih, Ko-Wei
    Liu, Daphne Der-Fen
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (01) : 5 - 26
  • [5] Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
    Hu, Xiaolan (xlhu@mail.ccnu.edu.cn), 2017, Elsevier B.V., Netherlands (233)
  • [6] Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
    Hu, Xiaolan
    Zhang, Yunqing
    Miao, Zhengke
    DISCRETE APPLIED MATHEMATICS, 2017, 233 : 29 - 32
  • [7] Upper bounds on the D(β)-vertex-distinguishing edge-chromatic numbers of graphs
    Tian Jing-jing
    Liu Xin-sheng
    Zhang Zhong-fu
    Deng Fang-an
    COMPUTATIONAL SCIENCE - ICCS 2007, PT 3, PROCEEDINGS, 2007, 4489 : 453 - +
  • [8] Upper Bounds on the D(β)-Vertex-Distinguishing Total-Chromatic Number of Graphs
    Liu Xin-sheng
    Zhu Zhi-qiang
    ARS COMBINATORIA, 2015, 119 : 403 - 411
  • [9] UPPER BOUNDS FOR THE D(β)-VERTEX-DISTINGUISHING EI-TOTAL CHROMATIC NUMBERS OF GRAPHS
    Liu, Xinsheng
    Wang, Zhiqiang
    2011 3RD INTERNATIONAL CONFERENCE ON COMPUTER TECHNOLOGY AND DEVELOPMENT (ICCTD 2011), VOL 2, 2012, : 265 - 269
  • [10] The strong chromatic index of Halin graphs
    Lai, Hsin-Hao
    Lih, Ko-Wei
    Tsai, Ping-Ying
    DISCRETE MATHEMATICS, 2012, 312 (09) : 1536 - 1541
12345