DocumentCode :
2730518
Title :
A generalization of network graph complementary spanning trees
Author :
Nenov, Georgi A.
Author_Institution :
Higher Sch. of Transp. T. Kableshkov, Sofia
fYear :
2008
fDate :
10-11 July 2008
Firstpage :
162
Lastpage :
165
Abstract :
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.
Keywords :
network analysis; network synthesis; trees (mathematics); circuit analysis; graph theory; network analysis; network graph complementary spanning trees; network synthesis; network variables; nonoriented graph; Circuit analysis; Electronic mail; Equations; Graph theory; Network synthesis; Tree graphs; Visualization; Voltage;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems for Communications, 2008. ECCSC 2008. 4th European Conference on
Conference_Location :
Bucharest
Print_ISBN :
978-1-4244-2419-1
Electronic_ISBN :
978-1-4244-2420-7
Type :
conf
DOI :
10.1109/ECCSC.2008.4611668
Filename :
4611668
Link To Document :
بازگشت