Final stellation of the icosahedron 180 triangular faces, which are the outermost triangular regions in the stellation diagram. These join along 270 edges, which in turn meet at 92 vertices, with an Euler characteristic of 2. The 92 vertices lie on the surfaces of three concentric spheres. The innermost group of 20 vertices form the vertices of a regular dodecahedron; the next layer of 12 form the vertices of a regular icosahedron; and the outer layer of 60 form the vertices of a nonuniform truncated icosahedron. The radii of these spheres are in the ratio When regarded as a three-dimensional solid object with edge lengths
Distance-regular graph graphs with any given eigenvalue multiplicity formula_56 (with the exception of the complete multipartite graphs). The cubic distance-regular graphs have been completely classified. The 13 distinct cubic distance-regular graphs are K (or tetrahedron), K, the Petersen graph, the cube, the Heawood graph, the Pappus graph, the Coxeter graph, the Tutte–Coxeter graph, the dodecahedron, the Desargues graph, Tutte 12-cage, the Biggs–Smith graph, and the Foster graph. Distance-regular graph In mathematics, a distance-regular graph is a regular graph such that for any two vertices "v" and "w", the number of vertices at distance "j" from "v" and at distance "k" from "w"