A346448 - OEIS

%I #28 Feb 18 2022 20:50:40

%S 0,0,0,0,0,0,0,0,1,11,88,620

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

%C 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.

%C Note that for n=11, the runtime is about 4 days.

%H Craig M. Tennenhouse, <a href="https://doi.org/10.20429/tag.2017.030201">Induced Subgraph Saturated Graphs</a>, Theory and Applications of Graphs (2016) Vol. 3: Iss. 2, Article 1.

%K nonn,more

%O 0,10

%A _Mason Nakamura_, _Evan Sabini_, Xuwen Hua, _Jared Glassband_, _Kathleen Ryan_, _Brian G. Kronenthal_, Jul 30 2021