A lower bound on solutions of Chartrand's problem (Q1065813): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: A solution of Chartrand's problem on spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two Algorithms for Generating Weighted Spanning Trees in Order / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01883897 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2313769952 / rank | |||
Normal rank | |||
Latest revision as of 09:44, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on solutions of Chartrand's problem |
scientific article |
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
