Search Results for ""

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

A group action G×X->X is effective if there are no trivial actions. In particular, this means that there is no element of the group (besides the identity element) which does ...

A curve on the unit sphere S^2 is an eversion if it has no corners or cusps (but it may be self-intersecting). These properties are guaranteed by requiring that the curve's ...

Suppose that V is a group representation of G, and W is a group representation of H. Then the vector space tensor product V tensor W is a group representation of the group ...

Let S be a nonempty set, then a filter on S is a nonempty collection F of subsets of S having the following properties: 1. emptyset not in F, 2. If A,B in F, then A ...

A group action G×X->X is called free if, for all x in X, gx=x implies g=I (i.e., only the identity element fixes any x). In other words, G×X->X is free if the map G×X->X×X ...

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

Let S be a set and F={S_1,...,S_p} a nonempty family of distinct nonempty subsets of S whose union is union _(i=1)^pS_i=S. The intersection graph of F is denoted Omega(F) and ...

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