Y. Mao

activity

20122026

most citedOn extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices

21 citations · 90 across the 38 of their papers we have counts for

collaborators

Showing 2012Show all

2 papers · 1 filter

math.CO2012

Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs

Xueliang Li, Yaping Mao

Let $G$ be a graph, $S$ be a set of vertices of $G$ , and $λ (S)$ be the maximum number $ℓ$ of pairwise edge-disjoint trees $T_{1}, T_{2}, ..., T_{ℓ}$ in $G$ such that $S\subseteq V…

math.CO2012★ 21 cited

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, $h (n; κ ˉ \geq r)$ , which guarantees that any graph with $n$ vertices and $h (n; κ ˉ \geq r)$ edges will contain a pair of v…