By Topic

On optimally sparse cycle and coboundary basis for a linear graph

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

2 Author(s)

A graph-theoretic study of the computational efficiency of the generalized loop analysis and the generalized cutset analysis is presented. It is shown that the choice of an optimum mode of analysis will give rise to the sparsest loop impedance matrix and the sparsest cutset admittance matrix, respectively. The problem of formulating efficient algorithms for determining the optimum choice is shown to be strictly a problem in nonoriented linear graph. Two algorithms based on the concept of basis graph are presented and illustrated in detail with examples. A nonplanar version of the mesh analysis which generally yields a rather sparse loop impedance matrix is also included.

Published in:

Circuit Theory, IEEE Transactions on  (Volume:20 ,  Issue: 5 )