15 citations · 15 across the 2 of their papers we have counts for
2 papers
math.CO2015
Proper connection number of random graphs
Ran Gu, Xueliang Li, Zhongmei Qin
A path in an edge-colored graph is called a proper path if no two adjacent edges of the path are colored the same. For a connected graph , the proper connection number o…
math.CO2013★ 15 cited
The generalized 3-connectivity of random graphs
Ran Gu, Xueliang Li, Yongtang Shi
The generalized connectivity of a graph was introduced by Chartrand et al. Let be a nonempty set of vertices of , and be defined as the largest number of internal…