Search Results for ""

The Dejter graph is a weakly regular graph on 112 vertices and 336 edges with regular paremeters (nu,k,lambda,mu)=(112,6,0,(0,1,2)). It can be obtained by deleting a copy of ...

Euler (1772ab) conjectured that there are no positive integer solutions to the quartic Diophantine equation A^4=B^4+C^4+D^4. This conjecture was disproved by Elkies (1988), ...

The Greek problems of antiquity were a set of geometric problems whose solution was sought using only compass and straightedge: 1. circle squaring. 2. cube duplication. 3. ...

The golden triangle, sometimes also called the sublime triangle, is an isosceles triangle such that the ratio of the hypotenuse a to base b is equal to the golden ratio, ...

A Hamiltonian walk on a connected graph is a closed walk of minimal length which visits every vertex of a graph (and may visit vertices and edges multiple times). For ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

Let N samples be taken from a population with central moments mu_n. The sample variance m_2 is then given by m_2=1/Nsum_(i=1)^N(x_i-m)^2, (1) where m=x^_ is the sample mean. ...

A simplex, sometimes called a hypertetrahedron (Buekenhout and Parker 1998), is the generalization of a tetrahedral region of space to n dimensions. The boundary of a ...

The concept of a space is an extremely general and important mathematical construct. Members of the space obey certain addition properties. Spaces which have been ...

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...