Bounds on the maximum number of edge-disjoint Steiner trees of a graph (Q2716516)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bounds on the maximum number of edge-disjoint Steiner trees of a graph |
scientific article; zbMATH DE number 1599135
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds on the maximum number of edge-disjoint Steiner trees of a graph |
scientific article; zbMATH DE number 1599135 |
Statements
7 May 2002
0 references
edge-disjoint Steiner trees
0 references
edge-toughness
0 references
edge-connectivity
0 references
Bounds on the maximum number of edge-disjoint Steiner trees of a graph (English)
0 references
Let \(G\) be a connected graph and let \(K\) be a set of vertices of \(G\) with \(|K|\geq 2\). The paper discusses the problem to estimate the number of edge-disjoint Steiner trees on the set \(K\) in \(G\). It gives bounds of this number in terms of the edge-toughness and the edge-connectivity of \(G\).
0 references
