EUVIMEDEUVIMED entdecken
Crossref

Automated counting of spanning trees for several infinite families of graphs

Pablo Blanco, Doron Zeilberger

Enumerative Combinatorics and Applications · 24.04.2026 · 6 (3) · Article #S2R17

DOI: 10.54550/eca2026v6s3r17 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Enumerative Combinatorics and Applications, online erschienen am 24.04.2026. Verfasst von Pablo Blanco und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Using the theoretical basis developed by Yao and Zeilberger, we consider certain graph families whose structure results in a rational generating function for sequences related to spanning tree enumeration. Said families are Powers of Cycles and Powers of Path; later, we briefly discuss Torus graphs and Grid graphs. In each case we know, a priori, that the set of spanning trees of the family of graphs can be described in terms of a finite-state-machine, and hence there is a finite transfer-matrix that guarantees the generating function is rational. Finding this ``grammar'', and hence the transfer-matrix is very tedious, so a much more efficient approach is to use experimental mathematics. Since computing numerical determinants is so fast, one can use the matrix tree theorem to generate sufficiently many terms, then fit the data to a rational function. The whole procedure can be done rigorously a posteriori.

Zitieren

APA

Blanco, P., & Zeilberger, D. (2026). Automated counting of spanning trees for several infinite families of graphs. Enumerative Combinatorics and Applications, 6(3), Article #S2R17. https://doi.org/10.54550/eca2026v6s3r17

Vancouver

Blanco P, Zeilberger D. Automated counting of spanning trees for several infinite families of graphs. Enumerative Combinatorics and Applications. 2026;6(3):Article #S2R17. doi:10.54550/eca2026v6s3r17

BibTeX
@article{Blanco2026,
  author = {Blanco, Pablo and Zeilberger, Doron},
  title = {Automated counting of spanning trees for several infinite families of graphs},
  journal = {Enumerative Combinatorics and Applications},
  year = {2026},
  volume = {6},
  number = {3},
  pages = {Article #S2R17},
  doi = {10.54550/eca2026v6s3r17}
}
Kostenlos starten →