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.
Cite
CITATION STYLE
Shinoda, S., & Kawamoto, T. (1981). On central trees of a graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 108 LNCS, pp. 137–151). Springer Verlag. https://doi.org/10.1007/3-540-10704-5_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
