Maximally Distant Trees and Principal Partition of a Linear Graph
- 1 August 1969
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 16 (3) , 323-330
- https://doi.org/10.1109/tct.1969.1082966
Abstract
A pair of trees of a graph is said to be maximally distant if the distance between these trees is maximum in the graph. Necessary and sufficient conditions for maximally distant trees are presented. Fundamental properties of the maximally distant trees provide us with the principal partition of a graph that is uniquely determined for the graph. Some useful properties of the principal partition, together with the application to the classification of the trees, are discussed.Keywords
This publication has 6 references indexed in Scilit:
- On Hamilton Circuits in Tree GraphsIEEE Transactions on Circuit Theory, 1968
- The Existence of a Hamilton Circuit in a Tree GraphIEEE Transactions on Circuit Theory, 1967
- A Central TreeIEEE Transactions on Circuit Theory, 1966
- Hamilton Circuits in Tree GraphsIEEE Transactions on Circuit Theory, 1966
- On the Differing Abilities of RL Structures to Realize Natural FrequenciesIEEE Transactions on Circuit Theory, 1965
- On trees of a graph and their generationJournal of the Franklin Institute, 1961