Abstract
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.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The planar limit of $$ \mathcal{N} $$ = 2 superconformal field theories;Journal of High Energy Physics;2020-05
2. Series expansion of the percolation threshold on hypercubic lattices;Journal of Physics A: Mathematical and Theoretical;2018-10-25
3. On the Grundy number of Cameron graphs;Electronic Notes in Discrete Mathematics;2017-12
4. Counting lattice animals in high dimensions;Journal of Statistical Mechanics: Theory and Experiment;2011-09-22
5. Small latin squares, quasigroups, and loops;Journal of Combinatorial Designs;2007