Counting two-graphs related to trees (Q1344397): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:01, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting two-graphs related to trees |
scientific article |
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
