Counting two-graphs related to trees (Q1344397)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting two-graphs related to trees |
scientific article; zbMATH DE number 721223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting two-graphs related to trees |
scientific article; zbMATH DE number 721223 |
Statements
Counting two-graphs related to trees (English)
0 references
9 February 1995
0 references
Summary: 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.
0 references
two-graphs
0 references
enumeration
0 references
trees
0 references
0.8003934025764465
0 references
