DocumentCode
1734553
Title
Enumerating all the spanning trees in an un-oriented graph - A novel approach
Author
Onete, Cristian E. ; Onete, Maria Cristina C
Author_Institution
IP&L Dept., NXP Semicond., Eindhoven, Netherlands
fYear
2010
Firstpage
1
Lastpage
5
Abstract
In this paper, we use a modified version of the incidence matrix of an un-oriented graph so as to enumerate all the spanning trees. In particular, we formally describe the problem and then enumerate the spanning trees, also Showing how to use this method in finding the symbolic determinant of a passive circuit.
Keywords
directed graphs; passive networks; trees (mathematics); incidence matrix; passive circuit; spanning trees; symbolic determinant; unoriented graph; Admittance; Algorithm design and analysis; Circuit synthesis; Complexity theory; Conferences; Integrated circuit modeling; Passive circuits; determinant; passive circuit; spanning trees; symbolic;
fLanguage
English
Publisher
ieee
Conference_Titel
Symbolic and Numerical Methods, Modeling and Applications to Circuit Design (SM2ACD), 2010 XIth International Workshop on
Conference_Location
Gammath
Print_ISBN
978-1-4244-6816-4
Type
conf
DOI
10.1109/SM2ACD.2010.5672365
Filename
5672365
Link To Document