Search Results for ""

Let V(G) be the vertex set of a simple graph and E(G) its edge set. Then a graph isomorphism from a simple graph G to a simple graph H is a bijection f:V(G)->V(H) such that ...

There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...

An orientation of an undirected graph G is an assignment of exactly one direction to each of the edges of G. Only connected, bridgeless graphs can have a strong orientation ...

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