|
| |
|
|
A367144
|
|
Number of simplical-free simple graphs on n unlabeled vertices.
|
|
1
|
|
|
|
1, 0, 0, 0, 1, 4, 24, 191, 3095, 95208, 5561999
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,6
|
|
|
COMMENTS
|
A simplical-free graph is a graph without simplical vertices. A simplical vertex is one whose neighbors induce a complete graph.
|
|
|
LINKS
|
|
|
|
FORMULA
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,more
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
