Geodesic
Compositions of graphs revisited
The electronic journal of combinatorics, Tome 14 (2007)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1016
Classification : 05A15, 05A05, 05A18, 05C30
Mots-clés : graph compositions, bipartite graph, Stirling number, composition counting formulas, exponential generating functions 
@article{10_37236_1016,
     author = {Aminul Huq},
     title = {Compositions of graphs revisited},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/1016},
     zbl = {1158.05007},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1016/}
}
TY  - JOUR
AU  - Aminul Huq
TI  - Compositions of graphs revisited
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1016/
DO  - 10.37236/1016
ID  - 10_37236_1016
ER  - 
%0 Journal Article
%A Aminul Huq
%T Compositions of graphs revisited
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/1016/
%R 10.37236/1016
%F 10_37236_1016
Aminul Huq. Compositions of graphs revisited. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/1016

Cité par Sources :