A346448 - OEIS

A346448

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

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 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

Table of n, a(n) for n=0..11.

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

Adjacent sequences: A346445 A346446 A346447 * A346449 A346450 A346451

KEYWORD

nonn,more

AUTHOR

Mason Nakamura, Evan Sabini, Xuwen Hua, Jared Glassband, Kathleen Ryan, Brian G. Kronenthal, Jul 30 2021

STATUS

approved