Abstract
The concept of central trees of a graph has attracted our attention in relation to electrical network theory. Until now, however, only a few properties of central trees have been clarified. In this paper, in connection with the critical sets of the edge set of a graph, some new theorems on central trees of the graph are presented. Also, a few examples are included to illustrate the applications of these theorems.
The main part of this paper was presented at the 14-th Asilomar conference on Circuits, Systems and Computers held on November 17–19, 1980 at Pacific Grove, California, U.S.A.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
N. Deo: A central tree, IEEE Trans. Circuit Theory; Vol. CT-13, pp.439–440, 1960.
N. R. Malik: On Deo's central tree concept; IEEE Trans. Circuit Theory, Vol. CT-15, pp.283–284, 1968.
V. Amoia and G. Cottafava: Invariance properties of central trees; IEEE Trans. Circuit Theory, Vol. CT-18, pp,465–467, 1971.
G. Kishi and Y. Kajitani: Generalized topological degree of freedom in analysis of LCR networks; Papers of the Technical Group on Circuit and System Theory of Inst. Elec. Comm. Eng. Japan, No.CT 71-19, pp.1–13, July 1971.
Y. Kajitani: The semibasis in network analysis and graph theoretical degree of freedom; IEEE Trans. Circuits and Systems, Vol.CAS-26, pp.846–854, 1979.
T. Kawamoto, Y. Kajitani and S. Shinoda: New theorems on central trees described in connection with the principal partition of a graph, Papers of the Thchnical Group on Circuit and System Theory of Inst. Elec. Comm. Eng. Japan, No.CST77-109, pp. 63–69, Dec. 1977.
S. Shinoda, M. Kitano and C. Ishida: Two theorems in connection with partitions of graphs; Papers of the Technical Group on Circuits and Systems of Inst. Elec. Comm. Eng. Japan, No.CAS79-146, pp.1–6, Jan. 1980.
S. Shinoda and K. Saishu: Conditions for an incidence set to be a central tree, ibid., No.CAS80-6, pp. 41–46, Apr. 1980.
G. Kishi and Y. Kajitani: On maximally distinct trees, Proceedings of the Fifth Annual Allerton Conference on Circuit and System Theory, University of Illinois, pp.635–643, Oct. 1967.
S. Shinoda: Principal partitions of graphs with applications to graph and network problems, Proc. of Inst. Elec. Comm. Eng. Japan, Vol.62, pp.763–772, 1979.
N. Tomizawa: Strongly irreducible matroids and principal partitions of a matroid into strongly irreducible minors, Trans. Inst. Elec. comm. Eng. Japan, Vol. J59-A, pp.83–91, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shinoda, S., Kawamoto, T. (1981). On central trees of a graph. In: Saito, N., Nishizeki, T. (eds) Graph Theory and Algorithms. Lecture Notes in Computer Science, vol 108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10704-5_12
Download citation
DOI: https://doi.org/10.1007/3-540-10704-5_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10704-0
Online ISBN: 978-3-540-38661-2
eBook Packages: Springer Book Archive