2 citations · 7 across the 12 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014
Note on the upper bound of the rainbow index of a graph
Qingqiong Cai, Xueliang Li, Yan Zhao
A path in an edge-colored graph , where adjacent edges may be colored the same, is a rainbow path if every two edges of it receive distinct colors. The rainbow connection number…
math.CO2014★ 1 cited
The 3-rainbow index and connected dominating sets
Qingqiong Cai, Xueliang Li, Yan Zhao
A tree in an edge-colored graph is said to be rainbow if no two edges on the tree share the same color. An edge-coloring of is called 3-rainbow if for any three vertices in …
math.CO2014
The generalized 3-edge-connectivity of lexicographic product graphs
Xueliang Li, Jun Yue, Yan Zhao
The generalized -edge-connectivity of a graph is a generalization of the concept of edge-connectivity. The lexicographic product of two graphs and , denoted…