Search Results for ""
111 - 120 of 13135 for visualized mathematicsSearch Results
View search results from all Wolfram sites (61339 matches)The Perkel graph is a weakly regular graph on 57 vertices and 171 edges, shown above in several embeddings. It is the unique distance-regular graph with intersection array ...
The Folkman graph is a semisymmetric graph that has the minimum possible number of nodes (20) (Skiena 1990, p. 186). It is implemented in the Wolfram Language as ...
The cubitruncated cuboctahedral graph is the skeleton of the cubitruncated cuboctahedron, which is the only uniform polyhedron for which this is the case. It is illustrated ...
The ditrigonal icosidodecahedral graph is the skeleton of the cube 5-compound, ditrigonal dodecadodecahedron, great ditrigonalIcosidodecahedron, and small ditrigonal ...
The dodecadodecahedral graph is the skeleton of the dodecadodecahedron, great dodecahemicosahedron, and small dodecahemicosahedron. It is illustrated above in several ...
The tetragonal antiwedge graph is the skeleton of the tetragonal antiwedge. It is a has 6 vertices, 10 edges, and 6 faces. The tetragonal antiwedge graph is self-dual and is ...
The n-centipede graph, n-centipede tree, n-comb graph (Seoud and Youssef 2017), or simply "n-centipede," is the tree on 2n nodes obtained by joining the bottoms of n copies ...
An (n,k)-firecracker is a graph obtained by the concatenation of n k-stars by linking one leaf from each (Chen et al. 1997, Gallian 2007). Firecracker graphs are graceful ...
The gem graph is the fan graph F_(4,1) illustrated above. It is implemented in the Wolfram Language as GraphData["GemGraph"].
The Hoffman graph is the bipartite graph on 16 nodes and 32 edges illustrated above that is cospectral to the tesseract graph Q_4 (Hoffman 1963, van Dam and Haemers 2003). ...
...