Determinantal generating functions of colored spanning forests (Q1774658)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Determinantal generating functions of colored spanning forests |
scientific article; zbMATH DE number 2168611
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determinantal generating functions of colored spanning forests |
scientific article; zbMATH DE number 2168611 |
Statements
Determinantal generating functions of colored spanning forests (English)
0 references
18 May 2005
0 references
Summary: The color type of a spanning forest of a graph with colored edges is defined and, subsequently, it is proved that the generating function of such spanning forests is obtained as the formal expansion of a certain determinant. An analogous determinantal expansion yields the generating function of all spanning forests of a given color type that contain a specific subforest. Algorithms are described for obtaining a list of all colored spanning trees and spanning forests of any graph with colored edges based on symbolic calculation.
0 references
0.89189106
0 references
0.88925636
0 references
0.8752487
0 references
0.87377954
0 references
0.86779106
0 references
0.8674202
0 references
0.8673984
0 references
0 references
