A solution to one of Kano's conjectures concerningk-th maximal spanning trees
- 14 Downloads
Let ℱ (G) be the collection of all spanning trees of a connected and weighted graphG, andF1,F2, ...,F m the partition of ℱ (G) such thatF n the set ofi-th maximal spanning trees ofG. Kano conjectured that for anyA ∈F1 and every integerk, 1≤k≤m, there existsT ∈F k such that |T/A|≤k−1. This paper gives the conjecture a very simple proof, and related results.
KeywordsSpan Tree Related Result Simple Proof Math Application Maximal Span
Unable to display preview. Download preview PDF.