|
| |
|
|
A079568
|
|
Number of unlabeled, connected graphs on n nodes which have no induced subgraph isomorphic to a P5, P5-bar or C5 and are not bipartite nor cobipartite nor split and are primes.
|
|
0
|
|
|
|
0, 0, 0, 0, 0, 0, 6, 34, 206, 1322, 9264, 73181
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,7
|
|
|
COMMENTS
|
P5 = path on five nodes. P5-bar = complement of P5. C5 = cycle on five nodes. Cobipartite means having a bipartite complement. G prime if G has no module (homogeneous set.) G split iff G and the complement of G are chordal.
|
|
|
LINKS
|
F. Hüffner, tinygraph, software for generating integer sequences based on graph properties.
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
more,nonn
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
a(10)-a(12) added using tinygraph by Falk Hüffner, Jan 25 2016
|
|
|
STATUS
|
approved
|
| |
|
|
