TU Darmstadt / ULB / TUbiblio

Enumerating all the spanning trees in an un-oriented graph -- A novel approach

Onete, Cristian and Onete, Cristina (2010):
Enumerating all the spanning trees in an un-oriented graph -- A novel approach.
[Article]

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.

Item Type: Article
Erschienen: 2010
Creators: Onete, Cristian and Onete, Cristina
Title: Enumerating all the spanning trees in an un-oriented graph -- A novel approach
Language: ["languages_typename_1" not defined]
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.

Uncontrolled Keywords: - SST: CASED
Divisions: LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
20 Department of Computer Science > Telecooperation
LOEWE > LOEWE-Zentren
20 Department of Computer Science
LOEWE
Event Location: Tunis-Gammarth. Tunisia
Date Deposited: 30 Dec 2016 20:23
Identification Number: TUD-CS-2010-23806
Export:

Optionen (nur für Redakteure)

View Item View Item