|
Search: id:A052431
|
|
|
| A052431 |
|
Number of perfect simple undirected graphs on n nodes. |
|
+0
2
|
|
| 1, 2, 4, 11, 33, 148, 906, 8887, 136756, 3269264, 115811998, 5855499195
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
A. Brandstaedt, V. B. Le and J. P. Spinrad, Graph Classes: A Survey, SIAM Publications, 1999.
S. Hougardy, Classes of perfect graphs, Discr. Math. 306 (2006), 2529-2571.
|
|
LINKS
|
S. Hougardy, Home Page
Brendan McKay, Perfect graphs
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
CROSSREFS
|
Cf. A052433.
Sequence in context: A123451 A123470 A123450 this_sequence A076316 A082104 A099215
Adjacent sequences: A052428 A052429 A052430 this_sequence A052432 A052433 A052434
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com)
|
|
EXTENSIONS
|
McKay link, giving more terms, supplied by Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 31 2003
a(12) added by N. J. A. Sloane (njas(AT)research.att.com) from the Hougardy paper, Oct 17 2006
|
|
|
Search completed in 0.002 seconds
|
