Enumeration of P4-free chordal graphs
Download:
by Robert Castelo, Robert Castelo, Nick Wormald, Nick Wormald
ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-2001/2001-12.pdf
Add To MetaCart
Abstract:
We count labelled chordal graphs with no induced path of length 3, both exactly and asymptotically. These graphs correspond to rooted trees in which no vertex has exactly one child, and each vertex has been expanded to a clique. Some properties of random graphs of this type are also derived. The corresponding unlabelled graphs are in 1-1 correspondence with unlabelled rooted trees on the same number of vertices. 1
Citations
| 183 | Graphical Enumeration – Harary, Palmer - 1973 |
| 74 | Asymptotic methods in enumeration – Bender - 1974 |
| 20 | On an Asymptotic Method in Enumeration – Meir, Moon - 1989 |
| 14 | Trivially perfect graphs – Golumbic - 1978 |
| 14 | The comparability graph of a tree – Wolk - 1962 |
| 12 | Remarks on an asymptotic method in combinatorics – Canfield - 1984 |
| 3 | Counting labelled chordal graphs – Wormald - 1985 |
| 2 | A characterization of moral transitive directed acyclic graph Markov models as trees and its properties – Castelo, Siebes - 2000 |
| 1 | A note on “The comparability graph of a tree”, Proc – Wolk - 1965 |
| 1 | A characterization of moral transitive acyclic directed graph Markov models as labeled trees – Castelo, Siebes - 2002 |
