

A346448


Number of nontrivial disconnected induced K_{1,3}saturated graphs on n vertices.


0



0, 0, 0, 0, 0, 0, 0, 0, 1, 11, 88, 620
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,10


COMMENTS

A graph G is induced Hsaturated if there exists no induced subgraph H in G, but for every edge e in the complement of G, the graph G+e has an induced subgraph H. We consider the complete graph K_n to be the trivial case. This is an empirical observation verified via a computer program.
Note that for n=11, the runtime is about 4 days.


LINKS



CROSSREFS



KEYWORD

nonn,more


AUTHOR



STATUS

approved



