On the spanning trees of weighted graphs

  • Ernst W. Mayr
  • C. Greg Plaxton
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 344)

Abstract

Given a weighted graph, let W1, W2, W3, ... denote the increasing sequence of all possible distinct spanning tree weights. Settling a conjecture due to Kano, we prove that every spanning tree of weight W1 is at most k — 1 edge swaps away from some spanning tree of weight Wk. 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 weight Wk.

Keywords

Span Tree Edge Weight Weighted Graph Weight Class Span Tree Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ed]
    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. [FT]
    M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. JACM, 34 (1987), 596–615.Google Scholar
  3. [JK]
    D. B. Johnson and S. D. Kashdan. Lower bounds for selection in X+Y and other multisets. JACM, 25 (1978), 556–570.Google Scholar
  4. [Kaj]
    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. [Kan]
    M. Kano. Maximum and kth maximal spanning trees of a weighted graph. Combinatorica, 7 (1987), 205–214.Google Scholar
  6. [KKS]
    T. Kawamoto, Y. Kajitani and S. Shinoda. On the second maximal spanning trees of a weighted graph (in Japanese). Trans. IECE of Japan, 61-A (1978), 988–995.Google Scholar
  7. [Kn]
    D. E. Knuth. The Art of Computer Programming Vol. I: Fundamental Algorithms, Addison-Wesley, Reading, Mass.Google Scholar
  8. [Kr]
    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. [La]
    E. L. Lawler. A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Management Sci., 18 (1972), 401–405.Google Scholar
  10. [OO]
    Okada and Onodera. Bull. Yamagata Univ., 2 (1952), 89–117 (cited in [Kn]).Google Scholar
  11. [Pr]
    R. C. Prim. Shortest connection networks and some generalizations. Bell System Technical J., 36 (1957), 1389–1401.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Ernst W. Mayr
  • C. Greg Plaxton

There are no affiliations available

Personalised recommendations