Search Results for ""

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

When the elliptic modulus k has a singular value, the complete elliptic integrals may be computed in analytic form in terms of gamma functions. Abel (quoted in Whittaker and ...

Pairs of partitions for a single number whose Ferrers diagrams transform into each other when reflected about the line y=-x, with the coordinates of the upper left dot taken ...

Let a Gram point g_n be called "good" if (-1)^nZ(g_n)>0, and "bad" otherwise (Rosser et al. 1969; Edwards 2001, p. 180). Then the interval between two consecutive good Gram ...

An extension of a group H by a group N is a group G with a normal subgroup M such that M=N and G/M=H. This information can be encoded into a short exact sequence of groups ...

The Hofstadter ellipses are a family of triangle ellipses introduced by P. Moses in February 2005. The Hofstadter ellipse E(r) for parameter 0<r<1 is defined by the trilinear ...

The Zariski topology is a topology that is well-suited for the study of polynomial equations in algebraic geometry, since a Zariski topology has many fewer open sets than in ...

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

A graph G is hypohamiltonian if G is nonhamiltonian, but G-v is Hamiltonian for every v in V (Bondy and Murty 1976, p. 61). The Petersen graph, which has ten nodes, is the ...

The icosahedral graph is the Platonic graph whose nodes have the connectivity of the regular icosahedron, as well as the great dodecahedron, great icosahedron Jessen's ...