|
|
A048193
|
|
Number of chordal graphs (or triangulated graphs) on n vertices.
|
|
5
|
|
|
1, 2, 4, 10, 27, 94, 393, 2119, 14524, 126758, 1392387, 19109099, 326005775, 6905776799, 181945055235
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Graphs having no induced cycles of any length > 3, so every cycle in the graph has a chord, or is "triangulated".
All such graphs are perfect.
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
Cf. A048192 (connected chordal graphs).
Cf. A287427 (disconnected chordal graphs).
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|