Search Results for ""

The set E of edges of a loopless graph (V,E), being a set of unordered pairs of elements of V, constitutes an adjacency relation on V. Formally, an adjacency relation is any ...

In a graph G, two graph vertices are adjacent if they are joined by a graph edge.

Every finite-dimensional Lie algebra of characteristic p=0 has a faithful finite-dimensional representation.

An almost alternating link with a single component.

An almost unit is a nonunit in the integral domain of formal power series with a nonzero first coefficient, P=a_1x+a_2x^2+..., where a_1!=0. Under the operation of ...

A knot diagram which has alternating under- and overcrossings as the knot projection is traversed. The first knot which does not have an alternating diagram has 8 crossings.

Let K_1^n and K_2^n be disjoint bicollared knots in R^(n+1) or S^(n+1) and let U denote the open region between them. Then the closure of U is a closed annulus S^n×[0,1]. ...

An anyon is a projective representation of a Lie group.

A theorem from information theory that is a simple consequence of the weak law of large numbers. It states that if a set of values X_1, X_2, ..., X_n is drawn independently ...

A maximal subgraph of an undirected graph such that any two edges in the subgraph lie on a common simple cycle.