login
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
OFFSET
0,10
COMMENTS
A graph G is induced H-saturated 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
Craig M. Tennenhouse, Induced Subgraph Saturated Graphs, Theory and Applications of Graphs (2016) Vol. 3: Iss. 2, Article 1.
CROSSREFS
Sequence in context: A334249 A192827 A022735 * A173731 A224179 A037601
KEYWORD
nonn,more
STATUS
approved