Search Results for ""

A Haar graph H(n) is a bipartite regular indexed by a positive integer and obtained by a simple binary encoding of cyclically adjacent vertices. Haar graphs may be connected ...

The Hoffman-Singleton graph is the graph on 50 nodes and 175 edges that is the only regular graph of vertex degree 7, diameter 2, and girth 5. It is the unique (7,5)-cage ...

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

A quadratic equation is a second-order polynomial equation in a single variable x ax^2+bx+c=0, (1) with a!=0. Because it is a second-order polynomial equation, the ...

Unlike quadratic, cubic, and quartic polynomials, the general quintic cannot be solved algebraically in terms of a finite number of additions, subtractions, multiplications, ...

The sinc function sinc(x), also called the "sampling function," is a function that arises frequently in signal processing and the theory of Fourier transforms. The full name ...

A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every vertex has k neighbors (i.e., the graph is a ...

An (ordinary) torus is a surface having genus one, and therefore possessing a single "hole" (left figure). The single-holed "ring" torus is known in older literature as an ...

The Tutte 12-cage, also called the Benson graph (Exoo and Jajcay 2008), is the unique 12-cage graph, equivalent to the generalized hexagon GH(2,2) and alternately called the ...

The Weierstrass elliptic functions (or Weierstrass P-functions, voiced "p-functions") are elliptic functions which, unlike the Jacobi elliptic functions, have a second-order ...