|
%I #8 Jul 11 2022 16:04:32
%S 1,0,1,1,1,1,2,2,4,5,7,10,16,27,42,67,116,187,329,570,970,1723,3021,
%T 5338,9563,16981,30517,54913,98847,179119,324333,589059,1072997,
%U 1955207,3573129,6538088
%N Number of polyhedra (3-polytopes) of graph radius 1 on n edges.
%C Data was gathered with the help of Scientific IT & Application Support (SCITAS) High Performance Computing (HPC) for the EPFL community.
%H R. W. Maffucci, <a href="https://arxiv.org/abs/2207.02040">On unigraphic 3-polytopes of radius one</a>, arXiv:2207.02040 [math.CO], 2022.
%e For n=6 there is only the tetrahedron, n=8 the square pyramid, n=9 the triangular bipyramid,...
%t Needs["IGraphM`"]
%t ra[8]:={Square pyramid}
%t ra[q]=opb[ra[q-1]]
%t opb[setg_] :=
%t Prepend[DeleteDuplicatesBy[
%t Flatten[Table[
%t EdgeAdd[g, UndirectedEdge[x[[1]], x[[2]]],
%t GraphLayout -> "TutteEmbedding"], {g, setg}, {x,
%t Flatten[Table[
%t Complement[Subsets[i, {2}],
%t Table[{i[[j]], i[[j + 1]]}, {j, Length[i] - 1}], {{i[[1]],
%t i[[-1]]}}], {i, Select[IGFaces[g], Length[#] > 3 &]}],
%t 1]}]], CanonicalGraph],
%t If[OddQ[EdgeCount[setg[[1]]]],
%t WheelGraph[EdgeCount[setg[[1]]]/2 + 3/2,
%t GraphLayout -> "TutteEmbedding", ImageSize -> 25], Nothing]]
%Y Cf. A002840.
%K nonn,more
%O 6,7
%A _Riccardo Maffucci_, Jul 11 2022
|
