Compositions of Graphs Revisited

Simple item page
dc.creatorHuq, Aminul
dc.date2007-04-28
dc.date.accessioned2026-07-07T07:58:40Z
dc.date.available2026-07-07T07:58:40Z
dc.descriptionThe 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.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/0704.3821
dc.identifierhttp://arxiv.org/abs/0704.3821
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/128094
dc.subjectCombinatorics
dc.subject05A05; 05C30; 05A15; 05A18
dc.titleCompositions of Graphs Revisited
dc.typetext

Files

Collections

arXiv