Search Results for ""

A graphical partitioning based on the eigenvalues and eigenvectors of the Laplacian matrix of a graph.

A polynomial which is not necessarily an invariant of a link. It is related to the dichroic polynomial. It is defined by the skein relationship ...

A stack F on a topological space X is said to be a stack of groupoids if for each open subset U subset= X, the category F(U) is a groupoid.

Let P(L) be the set of all prime ideals of L, and define r(a)={P|a not in P}. Then the Stone space of L is the topological space defined on P(L) by postulating that the sets ...

A straight line embedding, or "straight line drawing," of a graph is a graph embedding in which all edges are drawn as straight line segments (as opposed to curves, etc.).

A tensor category (C, tensor ,I,a,r,l) is strict if the maps a, l, and r are always identities. A related notion is that of a tensor R-category.

A subgroup is a subset H of group elements of a group G that satisfies the four group requirements. It must therefore contain the identity element. "H is a subgroup of G" is ...

The transitive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same transitive closure as R. Thus aR^'b for any elements a and b of X, ...

The set of all centroid points in a weighted tree (Harary 1994, p. 36).

If the Tutte polynomial T(x,y) of a graph G is given by sumt_(rs)x^ry^s, then the matrix (t_(rs)) is called the rank matrix of G. For example, the Tutte matrix of the ...