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 条
  • [41] Group Chromatic Number of Halin Graphs
    Xiangwen Li
    Graphs and Combinatorics, 2015, 31 : 1531 - 1538
  • [42] Some Upper Bounds for the 3-Proper Index of Graphs
    Chang, Hong
    Li, Xueliang
    Qin, Zhongmei
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2018, 41 (04) : 1681 - 1695
  • [43] Some upper bounds for 3-rainbow index of graphs
    Liu, Tingting
    Hu, Yumei
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2016, 97 : 217 - 225
  • [44] Some New Upper Bounds for the Y-Index of Graphs
    Maji, Durbar
    Ghorai, Ganesh
    Shami, Faria Ahmed
    JOURNAL OF MATHEMATICS, 2022, 2022
  • [45] Some Upper Bounds for the 3-Proper Index of Graphs
    Hong Chang
    Xueliang Li
    Zhongmei Qin
    Bulletin of the Malaysian Mathematical Sciences Society, 2018, 41 : 1681 - 1695
  • [46] On the oriented chromatic number of Halin graphs
    Dolama, Mohammad Hosseini
    Sopena, Eric
    INFORMATION PROCESSING LETTERS, 2006, 98 (06) : 247 - 252
  • [47] Vertex-splitting and chromatic index critical graphs
    Hilton, AJW
    Zhao, C
    DISCRETE APPLIED MATHEMATICS, 1997, 76 (1-3) : 205 - 211
  • [48] The adjacent vertex distinguishing total chromatic numbers of planar graphs with Δ=10
    Cheng, Xiaohan
    Wang, Guanghui
    Wu, Jianliang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (02) : 383 - 397
  • [49] Upper bounds on the uniquely restricted chromatic index
    Baste, Julien
    Rautenbach, Dieter
    Sau, Ignasi
    JOURNAL OF GRAPH THEORY, 2019, 91 (03) : 251 - 258
  • [50] Upper Bounds for the Automorphic Chromatic Index of a Graph
    Giuseppe Mazzuoccolo
    Beatrice Ruini
    Graphs and Combinatorics, 2014, 30 : 963 - 975
12345