Maximum andk-th maximal spanning trees of a weighted graph
- 1 June 1987
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 7 (2) , 205-214
- https://doi.org/10.1007/bf02579450
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Graph theoretical properties of the node determinant of an LCR networkIEEE Transactions on Circuit Theory, 1971
- On Coefficients of Polynomials in Network FunctionsIRE Transactions on Circuit Theory, 1960
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935