Spanning trees with few peripheral branch vertices (Q2233620)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7408217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spanning trees with few peripheral branch vertices |
scientific article; zbMATH DE number 7408217 |
Statements
Spanning trees with few peripheral branch vertices (English)
0 references
11 October 2021
0 references
For a graph \(G\), the authors prove sufficient conditions for the existence of a spanning tree \(T\) with few peripheral branch vertices, where a peripheral branch vertex of \(T\) is a leaf of its reducible stem. The conditions are formulated as bounds for the independence number and for the degree sum of \(G\).
0 references
spanning tree
0 references
leaf
0 references
peripheral branch vertex
0 references
independence number
0 references
degree sum
0 references
0 references
0.92976576089859
0 references
0.8883041739463806
0 references
0.8218280076980591
0 references
0.8151019811630249
0 references
