A342971 - OEIS

A342971

Non-1-tough simplicial polyhedra with n nodes.

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

(list; graph; refs; listen; history; text; internal format)

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

FORMULA

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

CROSSREFS

KEYWORD

nonn,hard,more

AUTHOR

STATUS

approved