|
Search: id:A048193
|
|
|
| A048193 |
|
Number of chordal graphs (or triangulated graphs) on n vertices. |
|
+0
1
|
|
| 1, 2, 4, 10, 27, 94, 393, 2119, 14524, 126758, 1392387
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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.
|
|
REFERENCES
|
S. Hougardy, Classes of perfect graphs, Discr. Math. 306 (2006), 2529-2571.
|
|
LINKS
|
S. Hougardy, Home Page
|
|
CROSSREFS
|
Cf. A048192, A048194.
Sequence in context: A007776 A123428 A005975 this_sequence A123411 A128933 A106362
Adjacent sequences: A048190 A048191 A048192 this_sequence A048194 A048195 A048196
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gordon Royle (gordon(AT)maths.uwa.edu.au)
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com), Jul 04 2008
|
|
|
Search completed in 0.002 seconds
|
