Xueliang Li

most citedThe rainbow

k

-connectivity of two classes of graphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2009

Note on the 4- and 5-leaf powers

Xueliang Li, Yongtang Shi, Wenli Zhou

Motivated by the problem of reconstructing evolutionary history, Nishimura et al. defined $k$ -leaf powers as the class of graphs $G = (V, E)$ which has a $k$ -leaf root $T$ , i.e., $T$ …

math.CO2009★ 1 cited

The rainbow $k$ -connectivity of two classes of graphs

Xueliang Li, Yuefang Sun

A path in an edge-colored graph $G$ , where adjacent edges may be colored the same, is called a rainbow path if no two edges of $G$ are colored the same. For a $κ$ -connected graph $…

math.CO2009

Sharp bounds for the generalized connectivity $κ_{3} (G)$

Shasha Li, Xueliang Li, Wenli Zhou

Let $G$ be a nontrivial connected graph of order $n$ and let $k$ be an integer with $2 \leq k \leq n$ . For a set $S$ of $k$ vertices of $G$ , let $κ (S)$ denote the maximum number $\el…

Note on the 4- and 5-leaf powers

The rainbow k-connectivity of two classes of graphs

Sharp bounds for the generalized connectivity κ3​(G)

The rainbow $k$ -connectivity of two classes of graphs

Sharp bounds for the generalized connectivity $κ_{3} (G)$