On extremal graphs with internally disjoint Steiner trees
From MaRDI portal
Publication:400783
zbMath1297.05121arXiv1210.8021MaRDI QIDQ400783
Hengzhe Li, Yaping Mao, Xue Liang Li
Publication date: 25 August 2014
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.8021
connectivitySteiner treeinternally disjoint treesgeneralized connectivitygeneralized local connectivity
Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Connectivity (05C40)
Related Items (9)
The \((k,\ell)\)-rainbow index for complete bipartite and multipartite graphs ⋮ Graphs with large generalized (edge-)connectivity ⋮ Path 3-(edge-)connectivity of lexicographic product graphs ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ Constructing edge-disjoint Steiner paths in lexicographic product networks ⋮ Tree connectivities of Cayley graphs on abelian groups with small degrees ⋮ On extremal graphs with exactly one Steiner tree connecting any $k$ vertices ⋮ Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs ⋮ Trees with 2-reinforcement number three
This page was built for publication: On extremal graphs with internally disjoint Steiner trees
