Search Results for ""

Cubic symmetric graphs are sometimes called Foster graphs and denoted F_(nnn)X, where nnn is the vertex count and X is a letter A, B, C, ... indicating the particular such ...

The Fritsch graph is the 9-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 fundamental group of an arcwise-connected set X is the group formed by the sets of equivalence classes of the set of all loops, i.e., paths with initial and final points ...

Let K be a number field with r_1 real embeddings and 2r_2 imaginary embeddings and let r=r_1+r_2-1. Then the multiplicative group of units U_K of K has the form ...

Hex is a two-player game invented by Piet Hein in 1942 while a student at Niels Bohr's Institute for Theoretical Physics, and subsequently and independently by John Nash in ...

The Gauss-Kuzmin distribution is the distribution of occurrences of a positive integer k in the continued fraction of a random (or "generic") real number. Consider xi_n ...

Seeks to obtain the best numerical estimate of an integral by picking optimal abscissas x_i at which to evaluate the function f(x). The fundamental theorem of Gaussian ...

For a given m, determine a complete list of fundamental binary quadratic form discriminants -d such that the class number is given by h(-d)=m. Heegner (1952) gave a solution ...

The gear graph, also sometimes known as a bipartite wheel graph (Brandstädt et al. 1987), is a wheel graph with a graph vertex added between each pair of adjacent graph ...

The gem graph is the fan graph F_(4,1) illustrated above. It is implemented in the Wolfram Language as GraphData["GemGraph"].