A generalization of network graph complementary spanning trees

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.