Search Results for ""
131 - 140 of 1330 for Simple interestSearch Results
View search results from all Wolfram sites (32948 matches)The skeleton of the bislit cube is the 8-vertex simple graph, illustrated above in several embeddings, which consists of a cube in which two opposite faces have polyhedron ...
The Nauru graph is the name given by Eppstein (2007) to the generalized Petersen graph GP(12,5) on 24 nodes and 36 edges which is also cubic symmetric graph F_(024)A, the ...
The Celmins-Swart snarks are the two snarks on 26 vertices and 39 edges illustrated above. They are implemented in the Wolfram Language as GraphData["CelminsSwartSnark1"] and ...
The dart graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["DartGraph"].
The deltoidal icositetrahedral graph is Archimedean dual graph which is the skeleton of the deltoidal icositetrahedron. It is implemented in the Wolfram Language as ...
The Golomb graph is a unit-distance graph discovered around 1960-1965 by Golomb (Soifer 2008, p. 19). It is implemented in the Wolfram Language as GraphData["GolombGraph"]. A ...
The Kittell graph is a planar graph on 23 nodes and 63 edges that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof of ...
The (m,n)-lollipop graph is the graph obtained by joining a complete graph K_m to a path graph P_n with a bridge. Precomputed properties of lollipop graphs are available in ...
The Meredith graph is a quartic nonhamiltonian graph on 70 nodes and 140 edges that is a counterexample to the conjecture that every 4-regular 4-connected graph is ...
The parachute graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["ParachuteGraph"].
...