Counting two-graphs related to trees

MaRDI QIDQ1344397zbMATH OpenFDO

Authors Peter J. Cameron

Publication date 9 February 1995

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/118557, http://www.emis.de/journals/EJC/Volume_2/volume2.html#R4

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

enumerationtreestwo-graphs

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Review text

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.

Recommendations

• Two-graphs and trees
• scientific article; zbMATH DE number 1984538
• scientific article; zbMATH DE number 125499
• scientific article; zbMATH DE number 4099342
• scientific article; zbMATH DE number 1735656

Cited in

(11)

• Enumeration of P₄-free chordal graphs
• Enumeration of subtrees of planar two-tree networks
• On the Grundy number of Cameron graphs
• scientific article; zbMATH DE number 3855139 (Why is no real title available?)
• scientific article; zbMATH DE number 125499 (Why is no real title available?)
• scientific article; zbMATH DE number 409493 (Why is no real title available?)
• Series expansion of the percolation threshold on hypercubic lattices
• Counting labeled Greg cacti and clique trees
• The Perimeter of Proper Polycubes
• Stories about groups and sequences
• The planar limit of \(\mathcal{N} = 2\) superconformal field theories

This page was built for publication: Counting two-graphs related to trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344397)