|
|
|
|
|
|
|
|
|
#8 by Michael De Vlieger at Mon Nov 06 19:49:13 EST 2023
|
|
|
|
|
|
|
|
#7 by Andrew Howroyd at Mon Nov 06 16:51:58 EST 2023
|
|
|
|
|
|
|
|
#6 by Andrew Howroyd at Mon Nov 06 16:51:01 EST 2023
|
|
| CROSSREFS
|
Cf. A366367. (connected).
|
|
|
|
|
|
|
#5 by Andrew Howroyd at Mon Nov 06 16:49:49 EST 2023
|
|
| COMMENTS
|
A simplical-free graph is a graph without simplical vertices. A simplical vertex is one whose neighbors induce a complete graph.
|
|
|
|
|
|
|
#4 by Andrew Howroyd at Mon Nov 06 16:49:07 EST 2023
|
|
| COMMENTS
|
A simplical-free graph is a graph without simplical vertices.
|
|
|
|
|
|
|
#3 by Andrew Howroyd at Mon Nov 06 16:06:28 EST 2023
|
|
| NAME
|
Number of simplical-free simple graphs on n unlabeled vertices.
|
|
|
|
|
|
|
#2 by Andrew Howroyd at Mon Nov 06 16:04:18 EST 2023
|
|
| NAME
|
allocatedNumber of simplical-free graphs on forn Andrewunlabeled Howroydvertices.
|
|
| DATA
|
1, 0, 0, 0, 1, 4, 24, 191, 3095, 95208, 5561999
|
|
| OFFSET
|
0,6
|
|
| FORMULA
|
Euler transform of A366367.
|
|
| CROSSREFS
|
Column k=0 of A367145.
Cf. A366367.
|
|
| KEYWORD
|
allocated
nonn,more
|
|
| AUTHOR
|
Andrew Howroyd, Nov 06 2023
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#1 by Andrew Howroyd at Mon Nov 06 15:42:56 EST 2023
|
|
| NAME
|
allocated for Andrew Howroyd
|
|
| KEYWORD
|
allocated
|
|
| STATUS
|
approved
|
|
|
|
|
|
