Generation and Realization of Trees and k-Trees
- 1 June 1964
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 11 (2) , 247-255
- https://doi.org/10.1109/tct.1964.1082276
Abstract
In this paper we consider an analysis-synthesis problem in graph theory. The analysis problem is that of efficient generation of trees, 2-trees, andk-trees of a given "labeled" graph. The synthesis problem is that of finding a graph that realizes a given set of trees, 2-trees, or realizes given sets of trees and 2-trees simultaneously. These results have a strong bearing upon topological analysis and synthesis of electrical networks.Keywords
This publication has 9 references indexed in Scilit:
- On trees of a graph and their generationJournal of the Franklin Institute, 1961
- On Realizability of a Set of TreesIRE Transactions on Circuit Theory, 1961
- A Computational Method for Network TopologyIRE Transactions on Circuit Theory, 1960
- Necessary and Sufficient Conditions for Realizability of Out-Set MatricesIRE Transactions on Circuit Theory, 1960
- Correction to "Reducing computing time in the analysis of networks by digital computer"IRE Transactions on Circuit Theory, 1959
- Irredundant and redundant Boolean branch-networksIEEE Transactions on Information Theory, 1959
- On Non-Series-Parallel Realization of Driving-Point FunctionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1957
- Topological Considerations in the Design of Driving-Point FunctionsIRE Transactions on Circuit Theory, 1955
- 2-Isomorphic GraphsAmerican Journal of Mathematics, 1933