Search Results for ""

The clique graph of a given graph G is the graph intersection of the family of cliques of G. A graph G is a clique graph iff it contains a family F of complete subgraphs ...

A coequalizer of a pair of maps f,g:X->Y in a category is a map c:Y->C such that 1. c degreesf=c degreesg, where degrees denotes composition. 2. For any other map c^':Y->C^' ...

A complete k-partite graph is a k-partite graph (i.e., a set of graph vertices decomposed into k disjoint sets such that no two graph vertices within the same set are ...

A set in Euclidean space R^d is convex set if it contains all the line segments connecting any pair of its points. If the set does not contain all the line segments, it is ...

Given a set X, let F be a nonempty set of subsets of X. Then F is a ring if, for every pair of sets in F, the intersection, union, and set difference is also in F. F is ...

A Turing machine is called deterministic if there is always at most one instruction associated with a given present internal state/tape state pair (q,s). Otherwise, it is ...

A doubly nonnegative matrix is a real positive semidefinite n×n square matrix with nonnegative entries. Any doubly nonnegative matrix A of order n can be expressed as a Gram ...

An equalizer of a pair of maps f,g:X->Y in a category is a map e:E->X such that 1. f degreese=g degreese, where degrees denotes composition. 2. For any other map e^':E^'->X ...

A quadrilateral in which a pair of opposite sides have the same length and are inclined at 60 degrees to each other (or equivalently, satisfy <A>+<B>=120 degrees). Some ...

Given a compact manifold M and a transversely orientable codimension-one foliation F on M which is tangent to partialM, the pair (M,F) is called a generalized Reeb component ...