Upper Bounds for 4-rainbow Index of Graphs

摘要：

　　In this paper,we study 4-rainbow index rx4(G)of G.We first show that rx4(G)is rx4(GD)+5 for the connected graph G with minimum degree δ(G)3 3,where D is the connected 3-dominating set of G.And then we determine a tight upper bound for Ks,t(4 ≤ s ≤ t)and a better bound for(P5,C5)-free graphs.Finally,we obtain a sharp bound for 4-rainbow index of general graphs.

作者: Shumin ZHANG

作者单位: School of Mathematics and Statistics,Qinghai Normal University Xining,Qinghai 810008,China

会议类型: 国际会议

会议名称: The 2017 2nd International Seminar on Applied Physics, Optoelectronics and Photonics (APOP 2017) (2017年第二届应用物理、光电子学和光子学国际研讨会)

会议地点: 上海

会议语种:英文

页码: 35-42

在线出版日期: 2017-12-30（万方平台首次上网日期，不代表论文的发表时间）