A342971 Non-1-tough simplicial polyhedra with n nodes.

1, 2, 29, 233, 2297, 21192, 195862

Offset: 11

Author

William P. Orrick, Apr 01 2021

Keywords

• nonn
• hard
• more

Comments

A graph is 1-tough if there is no set of k vertices whose deletion splits the graph into more than k components.

If a graph is not 1-tough then it is not Hamiltonian.

Crossrefs

Cf. A000109, A115340, A007030, A007031.

Formula

a(n) = A007030(n) - A007031(n).