Graph Compositions I: Basic Enumeration
Arnold Knopfmacher, Michael E. Mays · Zenodo (CERN European Organization for Nuclear Research) · 2001
The idea of graph compositions generalizes both ordinary compositions of positive integers and partitions of finite sets. In this paper we develop formulas, generating functions, and recurrence relations for composition counting functions for several families of graphs.