\(\Gamma \)-species and the enumeration of \(k\)-trees
The electronic journal of combinatorics, Tome 19 (2012) no. 4
We study the class of graphs known as $k$-trees through the lens of Joyal’s theory of combinatorial species (and a extension known as 'Γ-species' which incorporates data about 'structural' group actions). This culminates in a system of recursive functional equations giving the generating function for unlabeled $k$-trees which allows for fast, efficient computation of their numbers. Enumerations up to $k = 10$ and $n = 30$ (for a k-tree with $n + k − 1$ vertices) are included in tables, and Sage code for the general computation is included in an appendix.
DOI :
10.37236/2615
Classification :
05C30, 05E18
Mots-clés : combinatorial species, \(k\)-trees
Mots-clés : combinatorial species, \(k\)-trees
Affiliations des auteurs :
Andrew Gainer-Dewar  1
@article{10_37236_2615,
author = {Andrew Gainer-Dewar},
title = {\(\Gamma \)-species and the enumeration of \(k\)-trees},
journal = {The electronic journal of combinatorics},
year = {2012},
volume = {19},
number = {4},
doi = {10.37236/2615},
zbl = {1266.05065},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2615/}
}
Andrew Gainer-Dewar. \(\Gamma \)-species and the enumeration of \(k\)-trees. The electronic journal of combinatorics, Tome 19 (2012) no. 4. doi: 10.37236/2615
Cité par Sources :