Search Results for ""

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

For a connected graph G of graph diameter d, the distance-k graph G_k for k=1, ..., d is a graph with the same vertex set and having edge set consisting of the pairs of ...

There are a number of attractive cube 20-compounds that can be constructed by taking the duals of the octahedra in the two octahedron 20-compounds. The second of these was ...

Prince Rupert's cube is the largest cube that can be made to pass through a given cube. In other words, the cube having a side length equal to the side length of the largest ...

The bipartite double graph, also called the Kronecker cover, Kronecker double cover, bipartite double cover, canonical double cover, or bipartite double, of a given graph G ...

A chamfered cube, also inaccurately called a truncated rhombic dodecahedron or more accurately called a tetratruncated rhombic dodecahedron, is a polyhedron obtained by ...

A rolling polyhedron graph is a graph obtained by rolling a polyhedral solid along a board whose tiles match up with the faces of the polyhedron being rolled. The vertices of ...

The snub cube, also called the cubus simus (Kepler 1619, Weissbach and Martini 2002) or snub cuboctahedron, is an Archimedean solid having 38 faces (32 triangular and 6 ...

A cube 12-compound can be constructed from the vertices of the first dodecahedron 2-compound. It will be implemented in a future version of the Wolfram Language as ...

A cube 13-compound can be constructed as the dual of the octahedron 13-compound. It will be implemented in a future version of the Wolfram Language as ...