Search Results for ""
131 - 140 of 13134 for decoherence theorySearch Results
View search results from all Wolfram sites (24783 matches)The great rhombicosidodecahedral graph is the Archimedean graph on 120 vertices and 180 edges that is the skeleton of the great rhombicosidodecahedron as well as the uniform ...
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 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 Poussin graph is the 15-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...
The rising sun graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RisingSunGraph"].
The Schläfli double sixes graph is the Levi graph of the double sixes configuration.
The cubic Archimedean graph on 60 nodes and 90 edges that is the skeleton of the truncated dodecahedron. It is implemented in the Wolfram Language as ...
The pentagonal wedge graph is the skeleton of the pentagonal wedge. It is a has 8 vertices, 12 edges, and 6 faces. The pentagonal wedge graph is implemented in the Wolfram ...
The truncated dodecadodecahedral graph is the skeleton of the truncated dodecadodecahedron, which is the only uniform polyhedron for which this is the case. It will be ...
The Balaban 10-cage is one of the three (3,10)-cage graphs (Read and Wilson 1998, p. 272). The Balaban (3,10)-cage was the first known example of a 10-cage (Balaban 1973, ...
...