Search Results for ""

The generalized minimal residual (GMRES) method (Saad and Schultz 1986) is an extension of the minimal residual method (MINRES), which is only applicable to symmetric ...

The Gewirtz graph, sometimes also called the Sims-Gewirtz graph (Brouwer), is an integral graph on 56 nodes and 280 edges that is also a regular graph of order 10. It is ...

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

In 1611, Kepler proposed that close packing (either cubic or hexagonal close packing, both of which have maximum densities of pi/(3sqrt(2)) approx 74.048%) is the densest ...

The Kirchhoff index Kf, also simply called the resistance and denoted R (Lukovits et al. 1999), of a connected graph G on n nodes is defined by ...

The Klein bottle is a closed nonorientable surface of Euler characteristic 0 (Dodson and Parker 1997, p. 125) that has no inside or outside, originally described by Felix ...

The Legendre polynomials, sometimes called Legendre functions of the first kind, Legendre coefficients, or zonal harmonics (Whittaker and Watson 1990, p. 302), are solutions ...

The term Mandelbrot set is used to refer both to a general class of fractal sets and to a particular instance of such a set. In general, a Mandelbrot set marks the set of ...

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

In his last letter to Hardy, Ramanujan defined 17 Jacobi theta function-like functions F(q) with |q|<1 which he called "mock theta functions" (Watson 1936ab, Ramanujan 1988, ...