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

The total graph T(G) of a graph G has a vertex for each edge and vertex of G and an edge in T(G) for every edge-edge, vertex-edge, and vertex-vertex adjacency in G ...

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

A plane partition which is invariant under permutation of the three axes and which is equal to its complement (i.e., the collection of cubes that are in a given box but do ...

Let Omega be a bounded open set in R^d whose boundary partialOmega is at least C^1 smooth and let T:C_c^1(Omega^_)->L^p(partialOmega) (1) be a linear operator defined by ...

Let f:R×R->R be a one-parameter family of C^2 maps satisfying f(0,mu)=0 (1) [(partialf)/(partialx)]_(mu=0,x=0)=0 (2) [(partial^2f)/(partialxpartialmu)]_(0,0)>0 (3) ...

A shortened term for integral transform. Geometrically, if S and T are two transformations, then the similarity transformation TST^(-1) is sometimes called the transform ...

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