By Topic

The colored branch theorem and its applications in circuit theory

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)

The colored branch theorem (Minty 1960 [1]) is a result in graph theory, which essentially says that the existence (resp., nonexistence) of a certain loop immediately implies the nonexistence (resp., existence) of a certain cutset. Its relevance and use in circuit theory, however, has only recently been recognized. Since it is expected that many more applications in circuit theory will follow, the theorem is interpreted and proved in a network setting. Many graph-theoretic corollaries are derived, which may facilitate later use. It is illustrated that many results in circuit theory can he simplified or given a simpler proof using this theorem and its corollaries.

Published in:

Circuits and Systems, IEEE Transactions on  (Volume:27 ,  Issue: 9 )