A350485 The number of Assur graphs on n vertices.

1, 0, 1, 6, 32, 294, 3433, 50168, 860308

Offset

3,4

Comments

An Assur graph is a minimally rigid pinned graph that does not contain any smaller minimally rigid pinned graphs.

Links

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

Ciaran Mc Glue and Klara Stokes. Generating All Rigidity Circuits on at Most 10 Vertices and All Assur Graphs on at Most 11 Vertices, Journal of Integer Sequences 25.1 (2022).

B. Servatius, O. Shai, and W. Whiteley, Combinatorial characterization of the Assur graphs from engineering, Eur. J. Comb. 31 (2010), 1091-1104.

Crossrefs

Sequence in context: A121120 A183681 A326985 * A350109 A185386 A368287

Adjacent sequences: A350482 A350483 A350484 * A350486 A350487 A350488

Keyword

nonn,more

Author

Klara Stokes, Jan 01 2022

Status

approved