论文信息 - Enumeration of P4-Free Chordal Graphs

Enumeration of P4-Free Chordal Graphs

AbstractWe 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.

Nicholas C. Wormald | Robert Castelo | N. Wormald | R. Castelo

[1] E. Rodney Canfield. Remarks on an Asymptotic Method in Combinatorics , 1984, J. Comb. Theory, Ser. A.

[2] E. S. Wolk. The comparability graph of a tree , 1962 .

[3] E. Bender. Asymptotic Methods in Enumeration , 1974 .

[4] Frank Harary,et al. Graphical enumeration , 1973 .

[5] John W. Moon,et al. On an asymptotic method in enumeration , 1989, J. Comb. Theory, Ser. A.

[6] E. S. Wolk. A note on “The comparability graph of a tree” , 1965 .

[7] Herbert S. Wilf,et al. Generating functionology , 1990 .

[8] Nicholas C. Wormald,et al. Counting labelled chordal graphs , 1985, Graphs Comb..

[9] Arno Siebes,et al. A characterization of moral transitive acyclic directed graph Markov models as labeled trees , 2003 .

[10] A. Siebes,et al. A characterization of moral transitive directed acyclic graph Markov models as trees and its properties , 2001 .

[11] Martin Charles Golumbic,et al. Trivially perfect graphs , 1978, Discret. Math..