54 citations · 230 across the 74 of their papers we have counts for
5 papers · 1 filter
The generalized 3-connectivity of Lexicographic product graphs
Xueliang Li, Yaping Mao
The generalized -connectivity of a graph , introduced by Chartrand et al., is a natural and nice generalization of the concept of (vertex-)connectivity. In this pape…
Lower bounds for the spanning tree numbers of two graph products
Hengzhe Li, Xueliang Li, Yaping Mao +1
For any graph of order , the spanning tree packing number \emph{}, is the maximum number of edge-disjoint spanning trees contained in . In this paper, we obtain s…
Graphs with large generalized (edge-)connectivity
Xueliang Li, Yaping Mao
The generalized -connectivity of a graph , introduced by Hager in 1985, is a nice generalization of the classical connectivity. Recently, as a natural counterpart, w…
Further hardness results on the generalized connectivity of graphs
Lily Chen, Xueliang Li, Mengmeng Liu +1
The generalized -connectivity of a graph was introduced by Chartrand et al. in 1984, which is a nice generalization of the classical connectivity. Recently, as a na…
On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices
Xueliang Li, Yaping Mao
The concept of maximum local connectivity of a graph was introduced by Bollobás. One of the problems about it is to determine the largest number of edges $f(n;\barκ\leq \e…