Search Results for ""

Consider the solid enclosed by the three hyperboloids specified by the inequalities x^2+y^2-z^2 <= 1 (1) y^2+z^2-x^2 <= 1 (2) z^2+x^2-y^2 <= 1. (3) This work dubs this solid ...

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

Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...

The objective of global optimization is to find the globally best solution of (possibly nonlinear) models, in the (possible or known) presence of multiple local optima. ...

The set of graph eigenvalues of the adjacency matrix is called the spectrum of the graph. (But note that in physics, the eigenvalues of the Laplacian matrix of a graph are ...

Let L=<L, v , ^ > and K=<K, v , ^ > be lattices, and let h:L->K. Then h is a lattice homomorphism if and only if for any a,b in L, h(a v b)=h(a) v h(b) and h(a ^ b)=h(a) ^ ...

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

Let A be the area of a simply closed lattice polygon. Let B denote the number of lattice points on the polygon edges and I the number of points in the interior of the ...

The irrational constant R = e^(pisqrt(163)) (1) = 262537412640768743.9999999999992500... (2) (OEIS A060295), which is very close to an integer. Numbers such as the Ramanujan ...

The real projective plane is the closed topological manifold, denoted RP^2, that is obtained by projecting the points of a plane E from a fixed point P (not on the plane), ...