Search Results for ""

Let m(G) be the cycle rank of a graph G, m^*(G) be the cocycle rank, and the relative complement G-H of a subgraph H of G be defined as that subgraph obtained by deleting the ...

A search algorithm of a tree that explores the first child of a node before visiting its siblings. Tarjan (1972) and Hopcroft and Tarjan (1973) showed that depth-first search ...

A discrete group is a topological group with the discrete topology. Often in practice, discrete groups arise as discrete subgroups of continuous Lie groups acting on a ...

An edge-induced subgraph is a subset of the edges of a graph G together with any vertices that are their endpoints. The subgraph induced by a set of edges can be computed in ...

In a graph G, contraction of an edge e with endpoints u,v is the replacement of u and v with a single vertex such that edges incident to the new vertex are the edges other ...

The term endomorphism derives from the Greek adverb endon ("inside") and morphosis ("to form" or "to shape"). In algebra, an endomorphism of a group, module, ring, vector ...

The term energy has an important physical meaning in physics and is an extremely useful concept. There are several forms energy defined in mathematics. In measure theory, let ...

On a Lie group, exp is a map from the Lie algebra to its Lie group. If you think of the Lie algebra as the tangent space to the identity of the Lie group, exp(v) is defined ...

A subset F subset R of the real numbers is said to be an F_sigma set provided F is the countable union of closed sets. The name F_sigma comes from French: The F stands for ...

For any sequence of integers 0<n_1<...<n_k, there is a flag manifold of type (n_1, ..., n_k) which is the collection of ordered sets of vector subspaces of R^(n_k) (V_1, ..., ...