RAINBOW CONNECTION NUMBER OF GRAPHS WITH DIAMETER 3

被引：10
|
作者：
Li, Hengzhe [1 ]
Li, Xueliang
Sun, Yuefang
机构：
[1] Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
来源：
DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2017年 / 37卷 / 01期
关键词：
edge-coloring; rainbow path; rainbow connection number; diameter;
D O I：
10.7151/dmgt.1920
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every pair of distinct vertices of G is connected by a rainbow path. Let f(d) denote the minimum number such that rc(G) <= f(d) for each bridgeless graph G with diameter d. In this paper, we shall show that 7 <= f (3) <= 9.
引用
收藏
页码：141 / 154
页数：14
相关论文
共 50 条
  • [1] On the rainbow connection number of graphs
    Dror, G.
    Lev, A.
    Roditty, Y.
    Zigdon, R.
    ARS COMBINATORIA, 2017, 133 : 51 - 67
  • [2] Rainbow connection of graphs with diameter 2
    Li, Hengzhe
    Li, Xueliang
    Liu, Sujuan
    DISCRETE MATHEMATICS, 2012, 312 (08) : 1453 - 1457
  • [3] Rainbow Connection Number of Rocket Graphs
    Susilawati
    Salman, A. N. M.
    5TH INTERNATIONAL CONFERENCE ON MATHEMATICS AND NATURAL SCIENCES (ICMNS 2014), 2015, 1677
  • [4] PROPER RAINBOW CONNECTION NUMBER OF GRAPHS
    Trung Duy Doan
    Schiermeyer, Ingo
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021, 41 (03) : 809 - 826
  • [5] RAINBOW CONNECTION NUMBER OF DENSE GRAPHS
    Li, Xueliang
    Liu, Mengmeng
    Schiermeyer, Ingo
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2013, 33 (03) : 603 - 611
  • [6] The Rainbow Connection Number of Origami Graphs and Pizza Graphs
    Nabila, S.
    Salman, A. N. M.
    2ND INTERNATIONAL CONFERENCE OF GRAPH THEORY AND INFORMATION SECURITY, 2015, 74 : 162 - 167
  • [7] The Rainbow Connection Number of Origami Graphs and Pizza Graphs
    Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jalan Ganesa 10, Bandung
    40132, Indonesia
    Procedia Comput. Sci., (162-167):
  • [8] Oriented diameter and rainbow connection number of a graph
    Huang, Xiaolong
    Li, Hengzhe
    Li, Xueliang
    Sun, Yuefang
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2014, 16 (03): : 51 - 60
  • [9] Oriented diameter and rainbow connection number of a graph
    Center for Combinatorics and LPMC-TJKLC, Nankai University, Tianjin, China
    1600, Discrete Mathematics and Theoretical Computer Science (16):
  • [10] Graphs with small total rainbow connection number
    Yingbin Ma
    Lily Chen
    Hengzhe Li
    Frontiers of Mathematics in China, 2017, 12 : 921 - 936
12345