G{cyrillic}-species and the enumeration of k-trees

ISSN: 10778926
9Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

We study the class of graphs known as k-trees through the lens of Joyal's theory of combinatorial species (and an 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, effcient 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.

Cite

CITATION STYLE

APA

Gainer-Dewar, A. (2012). G{cyrillic}-species and the enumeration of k-trees. Electronic Journal of Combinatorics, 19(4).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free