2007/04/28 by Aminul Huq, Huq, Aminul
Mathematics · #05A05 #05A15 #05A18 #05C30 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05A05 #msc:05A15 #msc:05A18 #msc:05C30
paper · pdf · doi:10.48550/arxiv.0704.3821
6 pages
arxiv created 2007/04/28 · arxiv updated 2009/12/01
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. In their original paper they developed formulas, generating functions, and recurrence relations for composition counting functions for several families of graphs. Here we show that some of the results involving compositions of bipartite graphs can be derived more easily using exponential generating functions.