Skip to main content
Log in

Maximum andk-th maximal spanning trees of a weighted graph

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

LetA be a maximum spanning tree andP be an arbitrary spanning tree of a connected weighted graphG. Then we prove that there exists a bijectionψ fromA/P intoP/A such that for any edgeaA/P, (P/ψ(a)) ∪a is a spanning tree ofG whose weight is greater than or equal to that ofP. We apply this theorem to some problems concerning spanning trees of a weighted graph.

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

Access this article

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. N. Deo,Graph Theory with Applications to Engineering and Computer Science, Printice-Hall, New Jersey, 1974.

    MATH  Google Scholar 

  2. L. R. Ford andD. R. Fulkerson,Flows in Networks, Princeton University Press, New Jersey, 1962.

    MATH  Google Scholar 

  3. S. L. Hakimi andW. Maeda, On coefficients of polynomials in network function,IRE Trans. Circuit Theory, CT-7 (1960), 40–44.

    Google Scholar 

  4. P. Hall, On representatives of subsets,J. London Math. Soc.,10 (1935), 26–30.

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. E. Okamoto andY. Kajitani, A class of trees that determines a weighted graph (in Japanese),Trans. IECE of Japan,61-A (1978), 604–610.

    Google Scholar 

  9. R. C. Prim, Shortest connection networks and some generalizations,Bell System Tech. J.,36 (1957), 1389–1401.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kano, M. Maximum andk-th maximal spanning trees of a weighted graph. Combinatorica 7, 205–214 (1987). https://doi.org/10.1007/BF02579450

Download citation

  • Received:

  • Issue Date:

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

AMS subject classification (1980)

Navigation