Search Results for ""

For a graph G and a subset S^t of the vertex set V(G), denote by N_G^t[S^t] the set of vertices in G which are adjacent to a vertex in S^t. If N_G^t[S^t]=V(G), then S^t is ...

The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...

Given a complex measure mu, there exists a positive measure denoted |mu| which measures the total variation of mu, also sometimes called simply "total variation." In ...

A total order (or "totally ordered set," or "linearly ordered set") is a set plus a relation on the set (called a total order) that satisfies the conditions for a partial ...

Let H be a Hilbert space and (e_i)_(i in I) an orthonormal basis for H. The set of all products of two Hilbert-Schmidt operators is denoted N(H), and its elements are called ...

The transcendence degree of Q(pi), sometimes called the transcendental degree, is one because it is generated by one extra element. In contrast, Q(pi,pi^2) (which is the same ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

A tree decomposition is a mapping of a graph into a related tree with desirable properties that allow it to be used to efficiently compute certain properties (e.g., ...

A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...

Given a triangle with angles (pi/p, pi/q, pi/r), the resulting symmetry group is called a (p,q,r) triangle group (also known as a spherical tessellation). In three ...