A lower bound on solutions of Chartrand's problem (Q1065813)
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 3922674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on solutions of Chartrand's problem |
scientific article; zbMATH DE number 3922674 |
Statements
A lower bound on solutions of Chartrand's problem (English)
0 references
1984
0 references
Let G be a connected graph with circuit rank \(\rho\). The author proves that if G contains spanning trees with m and n end-vertices, respectively, with \(m<n\), then G contains at least \(\rho\) spanning trees with k end-vertices for every integer k with \(m<k<n\).
0 references
spanning trees
0 references
0.8843207955360413
0 references
0.8230761289596558
0 references
0.7875685691833496
0 references
0.7781087160110474
0 references
