Search Results for ""
611 - 620 of 990 for Path ConnectedSearch Results
The parapluie (French for 'umbrella') graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["ParapluieGraph"].
The Pasch graph is the Levi graph of the Pasch configuration. The Pasch graph is edge-transitive but not vertex-transitive, but fails to be semisymmetric since it is not ...
The plastic constant P, sometimes also called le nombre radiant, the minimal Pisot number, plastic number, plastic ratio, platin number, Siegel's number, or silver number, 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 R graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RGraph"].
The rising sun graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RisingSunGraph"].
The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...
The Schläfli double sixes graph is the Levi graph of the double sixes configuration.
If two similar figures lie in the plane but do not have parallel sides (i.e., they are similar but not homothetic), there exists a center of similitude, also called a ...
A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...
...


