Cart (Loading....) | Create Account
Close category search window
 

A generalization of network graph complementary spanning trees

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)
Nenov, Georgi A. ; Higher Sch. of Transp. T. Kableshkov, Sofia

The graph theory is wide used tool in network analysis and synthesis because it permits some useful visualization of the relationships between the network variables - currents and voltages (Seshu and Reed, 1961 and Lee, 1965). The spanning tree is one of the most important concepts in this theory - it applies to oriented as well as for nonoriented graphs. The choice of the corresponding spanning tree determines the equation system in circuit analysis. In the paper presented an attempt is made to generalize the concept of network oriented graph complementary spanning trees. The obtained results can be useful for the network analysis.

Published in:

Circuits and Systems for Communications, 2008. ECCSC 2008. 4th European Conference on

Date of Conference:

10-11 July 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.