Search Results for ""

A shortest path between two vertices of a graph is a graph path of shortest possible length between them. Such paths are also known as graph geodesics, and the matrix giving ...

The Coxeter configuration is a 12_3 configuration whose Levi graph is the Nauru graph.

The ophiuride is a cubic curve (left figure) given by the implicit equation x(x^2+y^2)+(ax-by)y=0, (1) where a>0,b>=0, or by the polar equation ...

A polar zonohedron is a convex zonohedron derived from the star which joins opposite vertices of any right n-gonal prism (for n even) or antiprism (for n odd). The faces of ...

The Riemann sphere, also called the extended complex plane, is a one-dimensional complex manifold C^* (C-star) which is the one-point compactification of the complex numbers ...

A symbol of the form {p,q,r,...} used to describe regular polygons, polyhedra, and their higher-dimensional counterparts. The symbol {p} denotes a regular polygon for integer ...

A graph is a forbidden (vertex-)induced subgraph if its presence as a vertex-induced subgraph of a given graph means it is not a member of some family of graphs. For example, ...

Two graphs are homeomorphic if there is a graph isomorphism from some graph subdivision of one to some subdivision of the other.

A unit-distance embedding is a graph embedding in which all edges have unit length. A graph possessing a unit-distance embedding in two dimensions is called a unit-distance ...

The Cox configuration is a (2^(d-1))_d configuration whose Levi graph is the d-hypercube graph.