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

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

Offset

11,2

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.

Links

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

Formula

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

Crossrefs

Cf. A000109, A115340, A007030, A007031.

Sequence in context: A178000 A036939 A342962 * A124301 A276196 A077023

Adjacent sequences: A342968 A342969 A342970 * A342972 A342973 A342974

Keyword

nonn,hard,more

Author

William P. Orrick, Apr 01 2021

Status

approved