21 citations · 23 across the 4 of their papers we have counts for
4 papers
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…
Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
Xueliang Li, Yaping Mao
Let be a graph, be a set of vertices of , and be the maximum number of pairwise edge-disjoint trees in such that $S\subseteq V…
On extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices
Hengzhe Li, Xueliang Li, Yaping Mao
The problem of determining the smallest number of edges, , which guarantees that any graph with vertices and edges will contain a pair of v…