Skip to main content
SpringerLink
Log in

On the spanning trees of weighted graphs

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

Given a weighted graph, letW 1,W 2,W 3,... denote the increasing sequence of all possible distinct spanning tree weights. Settling a conjecture due to Kano, we prove that every spanning tree of weightW 1 is at mostk−1 edge swaps away from some spanning tree of weightW k . Three other conjectures posed by Kano are proven for two special classes of graphs. Finally, we consider the algorithmic complexity of generating a spanning tree of weightW k .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Edmonds: Systems of distinct representatives and linear algebra,J. of Research and the National Bureau of Standards 71B (1967), 241–245.

    Google Scholar 

  2. M. L. Fredman, andR. E. Tarjan: Fibonacci heaps and their uses in improved network optimization algorithms,JACM 34 (1987), 596–615.

    Google Scholar 

  3. D. B. Johnson, andS. D. Kashdan: Lower bounds for selection inX+Y and other multisets,JACM 25 (1978), 556–570.

    Google Scholar 

  4. Y. Kajitani: Graph theoretical properties of the node determinant of an LCR network,IEEE Trans. Circuit Theory CT-18 (1971), 343–350.

    Google Scholar 

  5. M. Kano: Maximum andkth maximal spanning trees of a weighted graph,Combinatorica 7 (1987), 205–214.

    Google Scholar 

  6. T. Kawamoto, Y. Kajitani, andS. Shinoda: On the second maximal spanning trees of a weighted graph (in Japanese),Trans. IECE of Japan 61A (1978), 988–995.

    Google Scholar 

  7. D. E. Knuth:The Art of Computer Programming Vol. I: Fundamental Algorithms, Addison-Wesley, Reading, Mass.

  8. J. B. Kruskal: On the shortest spanning subtree of a graph and the traveling salesman problem,Proc. Amer. Math. Soc. 7 (1956), 48–50.

    Google Scholar 

  9. E. L. Lawler: A procedure for computing theK best solutions to discrete optimization problems and its application to the shortest path problem,Management Sci. 18 (1972), 401–405.

    Google Scholar 

  10. Okada, andOnodera:Bull. Yamagata Univ. 2 (1952), 89–117 (cited in [7]).

    Google Scholar 

  11. R. C. Prim: Shortest connection networks and some generalizationsBell System Technical J. 36 (1957), 1389–1401.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, J. W. Goethe-Universität, Frankfurt, FRG

    Ernst W. Mayr

  2. Department of Computer Science, University of Texas at Austin, Austin, Texas, U.S.A.

    C. Greg Plaxton

Authors
  1. Ernst W. Mayr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Greg Plaxton
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported in part by a grant from the AT&T foundation and NSF grant DCR-8351757.

Primarily supported by a 1967 Science and Engineering Scholarship from the Natural Sciences and Engineering Research Council of Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mayr, E.W., Plaxton, C.G. On the spanning trees of weighted graphs. Combinatorica 12, 433–447 (1992). https://doi.org/10.1007/BF01305236

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01305236

AMS subject classification code (1991)

Search

Navigation