DocumentCode :
1158911
Title :
Generation and Realization of Trees and k-Trees
Author :
Hakimi, S.L. ; Green, D.G.
Volume :
11
Issue :
2
fYear :
1964
fDate :
6/1/1964 12:00:00 AM
Firstpage :
247
Lastpage :
255
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, and 
-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.
-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 :
Admittance; Circuit theory; Graph theory; Network synthesis; Tree graphs;
fLanguage :
English
Journal_Title :
Circuit Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9324
Type :
jour
DOI :
10.1109/TCT.1964.1082276
Filename :
1082276
Link To Document :
