Search Results for ""

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 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"].

A semiperfect magic cube, sometimes also called an "Andrews cube" (Gardner 1976; Gardner 1988, p. 219) is a magic cube for which the cross section diagonals do not sum to the ...

Let alpha(G) denote the independence number of a graph G. Then the Shannon capacity Theta(G), sometimes also denoted c(G), of G is defined as ...

"The" square graphs is the cycle graph C_4. It is isomorphic to the complete bipartite graph K_(2,2). Like all cycle graphs, the line graph of C_4 is isomorphic to itself. A ...

The triangle graph is the cycle graph C_3, which is isomorphic to the complete graph K_3 as well as to the complete tripartite graph K_(3×1)=K_(1,1,1) and the triangular ...

A "weird number" is a number that is abundant (i.e., the sum of proper divisors is greater than the number) without being pseudoperfect (i.e., no subset of the proper ...

A zebra graph is a graph formed by all possible moves of a hypothetical chess piece called a "zebra" which moves analogously to a knight except that it is restricted to moves ...