A007031 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A007031

Non-Hamiltonian 1-tough simplicial polyhedra with n nodes.
(Formerly M4278)

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

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

OFFSET

1,14

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

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

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

CROSSREFS

Cf. A007030.

Sequence in context: A099673 A105928 A186665 * A067419 A113331 A333593

Adjacent sequences: A007028 A007029 A007030 * A007032 A007033 A007034

KEYWORD

nonn,hard,more

AUTHOR

N. J. A. Sloane.

STATUS

approved