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”).
%I #17 Jan 19 2022 08:17:48
%S 1,0,1,6,32,294,3433,50168,860308
%N The number of Assur graphs on n vertices.
%C An Assur graph is a minimally rigid pinned graph that does not contain any smaller minimally rigid pinned graphs.
%H Ciaran Mc Glue and Klara Stokes. <a href="https://cs.uwaterloo.ca/journals/JIS/VOL25/Stokes/stokes4.html">Generating All Rigidity Circuits on at Most 10 Vertices and All Assur Graphs on at Most 11 Vertices</a>, Journal of Integer Sequences 25.1 (2022).
%H B. Servatius, O. Shai, and W. Whiteley, <a href="https://doi.org/10.1016/j.ejc.2009.11.019">Combinatorial characterization of the Assur graphs from engineering</a>, Eur. J. Comb. 31 (2010), 1091-1104.
%K nonn,more
%O 3,4
%A _Klara Stokes_, Jan 01 2022