On extremal graphs with internally disjoint Steiner trees

zbMATH Open1297.05121arXiv1210.8021MaRDI QIDQ400783FDOQ400783

Authors: Hengzhe Li, Yaping Mao, Xueliang Li 

Publication date: 25 August 2014

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Abstract: The problem of determining the smallest number of edges, $$, which guarantees that any graph with $n$ vertices and $$ edges will contain a pair of vertices joined by $r$ internally disjoint paths was posed by Erd"{o}s and Gallai. Bollob'{a}s considered the problem of determining the largest number of edges $$ for graphs with $n$ vertices and local connectivity at most $ell$. One can see that $$. These two problems had received a wide attention of many researchers in the last few decades. In the above problems, only pairs of vertices connected by internally disjoint paths are considered. In this paper, we study the number of internally disjoint Steiner trees connecting sets of vertices with cardinality at least 3.

Full work available at URL: https://arxiv.org/abs/1210.8021

Recommendations

• On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
• On extremal graphs with exactly one Steiner tree connecting any \(k\) vertices
• Bounds on the maximum number of edge-disjoint Steiner trees of a graph
• The minimum size of a graph with given tree connectivity
• Steiner tree packing number and tree connectivity

zbMATH Keywords

connectivitySteiner treeinternally disjoint treesgeneralized connectivitygeneralized local connectivity

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Cited In (11)

• Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
• Trees with 2-reinforcement number three
• The \((k,\ell)\)-rainbow index for complete bipartite and multipartite graphs
• Constructing edge-disjoint Steiner paths in lexicographic product networks
• EXTREME STEINER GRAPHS
• On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
• On extremal graphs with exactly one Steiner tree connecting any \(k\) vertices
• Graphs with large generalized (edge-)connectivity
• Bounds on the maximum number of edge-disjoint Steiner trees of a graph
• Tree connectivities of Cayley graphs on abelian groups with small degrees
• Path 3-(edge-)connectivity of lexicographic product graphs

This page was built for publication: On extremal graphs with internally disjoint Steiner trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q400783)