By Topic

Generation of Trees, Two-Trees, and Storage of Master Forests

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

A new method of listing all possible trees of any given graph without duplication or redundancy, using simple geometrical properties of the graph, is proposed. The procedure given is suitable for both manual and automatic computation, and any modifications to the given graph can be catered to by suitable interpolation and extrapolation. An alternate method for complete graphs, derived from it, gives the trees arranged in an order most suitable for their storage as master forest matrices and for directly obtaining trees and 2-trees of any given graph through simple modifications to them instead of starting from scratch every time. Some properties of master forest matrices are discussed, which., inter alia, lead to a formula for the number of trees in a sub-graph of a complete graph. While an edge-numbering convention and a criterion for a tree play the key roles in systematic generation of trees, the storage technique makes it possible to obtain all the co-factors and determinants of a node-admittance matrix of any network (within the range of storage) by merely operating on one single master forest matrix.

Published in:

Circuit Theory, IEEE Transactions on  (Volume:15 ,  Issue: 3 )