Abstract
The efficiency with which a complex electrical network may be analyzed by a digital computer depends, largely, upon the efficiency with which the trees of the corresponding graph are generated. This paper is a presentation of those properties of a set of trees that aid us in generating the trees of a given graph. Two different methods for generating trees of a graph are described. Both these methods are extremely efficient for graphs whose nullities are small in comparison to their ranks, especially if the computer is supplied with bit-wise logical instructions. An important theoretical question, that of testing a given set of trees for “completeness,” is also considered.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
