Determinantal generating functions of colored spanning forests
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2004-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/S0161171204302206 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832554232825249792 |
|---|---|
| author | Gregory M. Constantine Marius G. Buliga |
| author_facet | Gregory M. Constantine Marius G. Buliga |
| author_sort | Gregory M. Constantine |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-8d48c0b91f454d2b8bdb07167f16da4f |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 2004-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-8d48c0b91f454d2b8bdb07167f16da4f2025-02-03T05:51:59ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04252004-01-012004627328310.1155/S0161171204302206Determinantal generating functions of colored spanning forestsGregory M. Constantine0Marius G. Buliga1Department of Mathematics, University of Pittsburgh, Pittsburgh, PA 15260, USADepartment of Mathematics, University of Pittsburgh at Bradford, Bradford, PA 16701, USAThe 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.http://dx.doi.org/10.1155/S0161171204302206 |
| spellingShingle | Gregory M. Constantine Marius G. Buliga Determinantal generating functions of colored spanning forests International Journal of Mathematics and Mathematical Sciences |
| title | Determinantal generating functions of colored spanning forests |
| title_full | Determinantal generating functions of colored spanning forests |
| title_fullStr | Determinantal generating functions of colored spanning forests |
| title_full_unstemmed | Determinantal generating functions of colored spanning forests |
| title_short | Determinantal generating functions of colored spanning forests |
| title_sort | determinantal generating functions of colored spanning forests |
| url | http://dx.doi.org/10.1155/S0161171204302206 |
| work_keys_str_mv | AT gregorymconstantine determinantalgeneratingfunctionsofcoloredspanningforests AT mariusgbuliga determinantalgeneratingfunctionsofcoloredspanningforests |