Please note, due to essential maintenance online purchasing will be unavailable between 08:00 and 12:00 (BST) on 24th February 2019. We apologise for any inconvenience.
A chordal graph is a graph in which every cycle of length at least 4 has a chord. If G is a random n-vertex labelled chordal graph, the size of the larget clique in about n/2 and deletion of this clique almost surely leaves only isolated vertices. This gives the asymptotic number of chordal graphs and information about a variety of things such as the size of the largest clique and connectivity.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.