A007031 Non-Hamiltonian 1-tough simplicial polyhedra with n nodes.

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 6, 72, 847, 9801

Offset: 1

Author

N. J. A. Sloane

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. - Hugo Pfoertner citing William P. Orrick in A342971, Aug 04 2021

References

• M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties. Tech. Rep. 92-91, Info. and Comp. Sci. Dept., Univ. Calif. Irvine, 1992.
• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties, J. Comb. Theory, Ser. B, 66 (1996) 87-122.

Crossrefs

Cf. A007030.