Geodesic
Counting two-graphs related to trees
The electronic journal of combinatorics, Tome 2 (1995)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In an earlier paper, I showed that the classes of pentagon-free two-graphs and of pentagon-and-hexagon-free two-graphs could be represented in terms of trees. This paper gives formulae for the numbers of labelled objects in each of these classes, as well as the numbers of labelled reduced two-graphs in each class. The proofs use various enumeration results for trees. At least some of these results are well-known. To make the paper self-contained, I have included proofs.
DOI : 10.37236/1198
Classification : 05C30, 05C05
Mots-clés : two-graphs, enumeration, trees 
@article{10_37236_1198,
     author = {Peter J. Cameron},
     title = {Counting two-graphs related to trees},
     journal = {The electronic journal of combinatorics},
     year = {1995},
     volume = {2},
     doi = {10.37236/1198},
     zbl = {0810.05031},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1198/}
}
TY  - JOUR
AU  - Peter J. Cameron
TI  - Counting two-graphs related to trees
JO  - The electronic journal of combinatorics
PY  - 1995
VL  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1198/
DO  - 10.37236/1198
ID  - 10_37236_1198
ER  - 
%0 Journal Article
%A Peter J. Cameron
%T Counting two-graphs related to trees
%J The electronic journal of combinatorics
%D 1995
%V 2
%U http://geodesic.mathdoc.fr/articles/10.37236/1198/
%R 10.37236/1198
%F 10_37236_1198
Peter J. Cameron. Counting two-graphs related to trees. The electronic journal of combinatorics, Tome 2 (1995). doi: 10.37236/1198

Cité par Sources :