Graphical Enumeration: A Species-Theoretic Approach

Abstract

An operation on species corresponding to the inner plethysm of their associated cycle index series is constructed. This operation, the inner plethysm of species, is generalized to n-sorted species. Polynomial maps on species are studied and used to extend inner plethysm and other operations to virtual species. Finally, inner plethysm and other operations on species are applied to various problems in graph theory. In particular, regular graphs, and digraphs in which every vertex has outdegree k, are enumerated.