Abstract
An equation is derived which is satisfied by special types of generating functions for labelled chordal graphs. This enables calculation of the numbers of labelled chordal graphs with given numbers of cliques of given sizes. From this is determined the number of n-vertex labelled chordal graphs with given connectivity. Calculations were completed for n≤13.
| Original language | English |
|---|---|
| Pages (from-to) | 193-200 |
| Number of pages | 8 |
| Journal | Graphs and Combinatorics |
| Volume | 1 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Dec 1985 |
| Externally published | Yes |