DocumentCode
1621526
Title
On the assignment of loops to graphs
Author
Chen, Wai-Kai ; Lu, Jiajian
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA
fYear
1989
Firstpage
331
Abstract
It is shown that it is always possible to assign m +1 loops (oriented circuits) to a graph, planar or nonplanar of nullity m so that the number of loops traversing in one direction through any edge equals the number of loops traversing in the opposite direction of the edge. Furthermore, any m of those m +1 loops are linearly independent. A procedure is given for the enumeration of these loops
Keywords
directed graphs; graph theory; enumeration; linearly independent; loops; nonplanar; nullity; oriented circuits; planar; Equations; Impedance;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1989., IEEE International Symposium on
Conference_Location
Portland, OR
Type
conf
DOI
10.1109/ISCAS.1989.100358
Filename
100358
Link To Document