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

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 square matrix is said to be totally positive if the determinant of any square submatrix, including the minors, is positive. For instance, any 2×2 matrix whose determinant ...

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

A matrix for a round-robin tournament involving n players competing in n(n-1)/2 matches (no ties allowed) having entries a_(ij)={1 if player i defeats player j; -1 if player ...

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

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 transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...