Search Results for ""

Given a set V of m vectors (points in R^n), the Gram matrix G is the matrix of all possible inner products of V, i.e., g_(ij)=v_i^(T)v_j. where A^(T) denotes the transpose. ...

The co-rank of a graph G is defined as s(G)=m-n+c, where m is the number of edges of G, n is the number of vertices, and c is the number of connected components (Biggs 1993, ...

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...

The number of nodes in a graph is called its order.

A special case of a flag manifold. A Grassmann manifold is a certain collection of vector subspaces of a vector space. In particular, g_(n,k) is the Grassmann manifold of ...

800 The dual of the great rhombidodecahedron U_(73) and Wenninger dual W_(109).

The dual of the stellated truncated hexahedron U_(19) and Wenninger dual W_(92)

A formula satisfied by all Hamiltonian cycles with n nodes. Let f_j be the number of regions inside the circuit with j sides, and let g_j be the number of regions outside the ...

Consider a clause (disjunction of literals) obtained from those of a first-order logic sentential formula Phi in Skolemized form forall x_1... forall x_nS, then a clause ...