Search Results for ""

Also called the Tait flyping conjecture. Given two reduced alternating projections of the same knot, they are equivalent on the sphere iff they are related by a series of ...

Consider the forms Q for which the generic characters chi_i(Q) are equal to some preassigned array of signs e_i=1 or -1, e_1,e_2,...,e_r, subject to product_(i=1)^(r)e_i=1. ...

A subset G subset R of the real numbers is said to be a G_delta set provided G is the countable intersection of open sets. The name G_delta comes from German: The G stands ...

Given a planar graph G, its geometric dual G^* is constructed by placing a vertex in each region of G (including the exterior region) and, if two regions have an edge x in ...

The eccentricity epsilon(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all ...

The eigenvalues of a graph are defined as the eigenvalues of its adjacency matrix. The set of eigenvalues of a graph is called a graph spectrum. The largest eigenvalue ...

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 radius of a graph is the minimum graph eccentricity of any graph vertex in a graph. A disconnected graph therefore has infinite radius (West 2000, p. 71). Graph radius is ...