Search Results for ""

The square knot, also called the reef knot, is a composite knot of six crossings consisting of a knot sum of a trefoil knot and its mirror image (Rolfsen 1976, p. 220). The ...

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...

A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G. If G^' is a subgraph of G, then G is said to be a supergraph of G^' ...

Let R be a commutative ring. A tensor category (C, tensor ,I,a,r,l) is said to be a tensor R-category if C is an R-category and if the tensor product functor is an R-bilinear ...

A graph H is called a topological minor, also known as a homeomorphic subgraph, of a graph G if a graph subdivision of H is isomorphic to a subgraph of G. Every topological ...

A category modeled after the properties of the category of sets. A category E is a topos if E has finite limits and every object of E has a power object (Barr and Wells 1985, ...

The transitive closure of a binary relation R on a set X is the minimal transitive relation R^' on X that contains R. Thus aR^'b for any elements a and b of X provided that ...

A unicyclic graph is a connected graph containing exactly one cycle (Harary 1994, p. 41). A connected unicyclic graph is therefore a pseudotree that is not a tree. ...

A left Hilbert Algebra A whose involution is an antilinear isometry is called a unimodular Hilbert algebra. The involution is usually denoted xi|->xi^*.