Abstract
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree of a graph is one for which the maximal distance to all other spanning trees is minimal. We prove that the problem of constructing a central spanning tree is algorithmically difficult and leads to an NP-complete problem.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Amoia A., Cottafava G.: Invariance Properties of central trees, IEEE Trans. Circuit Theory, vol. CT-18 (1971), 465–467.
Deo D.: A central tree, IEEE Trans. Circuit Th., vol. CT-13 (1966), 439–440.
Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman 1979.
Harary F.: Graph theory, Addison-Wesley Publ. Company, 1969.
Kaderali F.: A counterexample to the algorithm of Amoia and Cottafava for finding central trees, preprint, FB 19, TH Darmstadt, June 1973.
Kaderali F.: Über zentrale und maximal entfernte Bäume, unpublished manuscript.
Kajitani Y., Kawamoto T., Shinoda S.: A new method of circuit analysis and central trees of a graph, Electron. Commun. Japan, vol. 66 (1983), No. 1, 36–45.
Kawamoto T., Kajitani Y., Shinoda S.: New theorems on central trees described in connection with the principal partition of a graph, Papers of the Technical Group on Circuit and System theory of Inst. Elec. Comm. Eng. Japan, No. CST77-109 (1977), 63–69.
Kishi G., Kajitani Y.: Maximally distant trees and principal partition of a linear graph, IEEE Trans. Circuit Theory, vol. CT-16 (1969), 323–330.
Kishi G., Kajitani Y.: Maximally distant trees in a linear graph, Electronics and Communications in Japan (The Transactions of the Institute of Electronics and Communication Engineers of Japan), vol. 51 (1968), 35–42.
Kishi G., Kajitani Y.: On maximally distant trees, Proceedings of the Fifth Annual Allerton Conference on Circuit and System Theory, University of Illinois, Oct. 1967, 635–643.
Shinoda S., Kawamoto T.: On central trees of a graph, Lecture notes in Computer Sci., vol. 108 (1981), 137–151.
Shinoda S., Kawamoto T.: Central trees and critical sets, in Proc. 14th Asilomar Conf. on Circuit, Systems and Comp., Pacific Grove, Calif., 1980, D.E. Kirk ed., 183–187.
Shinoda S., Saishu K.: Conditions for an incidence set to be a central tree, Papers of the Technical Group on Circuit and System theory of Inst. Elec. Comm. Eng.Japan, No. CAS80-6 (1980), 41–46.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bezrukov, S., Kaderali, F., Poguntke, W. (1996). On central spanning trees of a graph. In: Deza, M., Euler, R., Manoussakis, I. (eds) Combinatorics and Computer Science. CCS 1995. Lecture Notes in Computer Science, vol 1120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61576-8_73
Download citation
DOI: https://doi.org/10.1007/3-540-61576-8_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61576-7
Online ISBN: 978-3-540-70627-4
eBook Packages: Springer Book Archive