DocumentCode :
1201862
Title :
A Computational Method for Network Topology
Author :
Watanabe, Hitoshi
Volume :
7
Issue :
3
fYear :
1960
fDate :
9/1/1960 12:00:00 AM
Firstpage :
296
Lastpage :
302
Abstract :
This paper deals with methods for listing all possible trees and multitrees, and for determining the relative signs of tree determinants and multitree determinants, which are necessary for the analysis of networks. A connected linear graph having 
elements and all of its possible subgraphs has been studied by mapping on an -dimensional vector space having base vectors, and a method for finding out a number of new trees from one tree, or a set of trees, has been derived. Also, a method of computation for determining the relative signs of tree determinants has been developed. These computations can be performed easily and effectively by a digital computer provided with bitwise logical instructions.
elements and all of its possible subgraphs has been studied by mapping on an -dimensional vector space having base vectors, and a method for finding out a number of new trees from one tree, or a set of trees, has been derived. Also, a method of computation for determining the relative signs of tree determinants has been developed. These computations can be performed easily and effectively by a digital computer provided with bitwise logical instructions.Keywords :
Circuits; Cities and towns; Computer aided instruction; Computer networks; Network topology; Transfer functions; Tree graphs; Vectors;
fLanguage :
English
Journal_Title :
Circuit Theory, IRE Transactions on
Publisher :
ieee
ISSN :
0096-2007
Type :
jour
DOI :
10.1109/TCT.1960.1086675
Filename :
1086675
Link To Document :
