Search Results for ""

The skewness of a graph G is the minimum number of edges whose removal results in a planar graph (Harary 1994, p. 124). The skewness is sometimes denoted mu(G) (Cimikowski ...

The great retrosnub icosidodecahedron, also called the great inverted retrosnub icosidodecahedron is the uniform polyhedron with Maeder index 74 (Maeder 1997), Wenninger ...

The great snub icosidodecahedron is the uniform polyhedron with Maeder index 57 (Maeder 1997), Wenninger index 116 (Wenninger 1989), Coxeter index 88 (Coxeter et al. 1954), ...

Let S be a nonempty set of real numbers that has a lower bound. A number c is the called the greatest lower bound (or the infimum, denoted infS) for S iff it satisfies the ...

The inhomogeneous Helmholtz differential equation is del ^2psi(r)+k^2psi(r)=rho(r), (1) where the Helmholtz operator is defined as L^~=del ^2+k^2. The Green's function is ...

Green's identities are a set of three vector derivative/integral identities which can be derived starting with the vector derivative identities del ·(psidel phi)=psidel ...

Grelling's paradox, also known as the Grelling-Nelson paradox or heterological paradox, is a semantic paradox that arises by defining "heterological" to mean "a word which ...

The gyrate rhombicosidodecahedron is a convex equilateral solid obtained by rotating one of the pentagonal cupolas of a small rhombicosidodecahedron by 1/10 of a turn. It is ...

The gyrobifastigium is an octahedron with on 8 vertices, 14 edges, and 8 faces. The equilateral gyrobifastigium is Johnson solid J_(26), consisting of two triangular prisms ...

A graph is said to be H^*-connected if it is either Hamilton-connected or Hamilton-laceable. S. Wagon (pers. comm., May. 20, 2013; Dupuis and Wagon 2014) conjecture that all ...