Search Results for ""

An unordered pair representation is a representation of an undirected graph in which edges are specified as unordered pairs of vertex indices. The unordered pairs ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

The upper half-plane is the portion of the complex plane {x+iy:x,y in (-infty,infty)} satisfying y=I[z]>0 i.e., {x+iy:x in (-infty,infty),y in (0,infty)}. Common notations ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

A triangular matrix U of the form U_(ij)={a_(ij) for i<=j; 0 for i>j. (1) Written explicitly, U=[a_(11) a_(12) ... a_(1n); 0 a_(22) ... a_(2n); | | ... |; 0 0 ... a_(nn)]. ...

There are a number of algebraic identities involving sets of four vectors. An identity known as Lagrange's identity is given by (AxB)·(CxD)=(A·C)(B·D)-(A·D)(B·C) (1) ...

The vector triple product identity is also known as the BAC-CAB identity, and can be written in the form Ax(BxC) = B(A·C)-C(A·B) (1) (AxB)xC = -Cx(AxB) (2) = -A(B·C)+B(A·C). ...

A vertex-induced subgraph (sometimes simply called an "induced subgraph") is a subset of the vertices of a graph G together with any edges whose endpoints are both in this ...

The vertex cover number is the size of a minimum vertex cover in a graph G is known as the vertex cover number of G, denoted tau(G). The König-Egeváry theorem states that the ...

The vertical perspective projection is a map projection that corresponds to the appearance of a globe when directly viewed from some distance away with the z-axis of the ...