Search Results for ""

A Vandermonde matrix is a type of matrix that arises in the polynomial least squares fitting, Lagrange interpolating polynomials (Hoffman and Kunze p. 114), and the ...

The Wigner 9j-symbols are a generalization of Clebsch-Gordan coefficients and Wigner 3j- and 6j-symbols which arises in the coupling of four angular momenta. They can be ...

Wynn's epsilon-method is a method for numerical evaluation of sums and products that samples a number of additional terms in the series and then tries to extrapolate them by ...

The detour index omega(G) of a graph G is a graph invariant defined as half the sum of all off-diagonal matrix elements of the detour matrix of G. Unless otherwise stated, ...

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs. The Goldner-Harary graph (Goldner and Harary 1975a, ...

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

Iofinova and Ivanov (1985) showed that there exist exactly five bipartite cubic semisymmetric graphs whose automorphism groups preserves the bipartite parts and acts ...

Triskaidekaphobia is the fear of 13, a number commonly associated with bad luck in Western culture. While fear of the number 13 can be traced back to medieval times, the word ...

The truncated dodecadodecahedral graph is the skeleton of the truncated dodecadodecahedron, which is the only uniform polyhedron for which this is the case. It will be ...

The word "base" in mathematics is used to refer to a particular mathematical object that is used as a building block. The most common uses are the related concepts of the ...