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

Let f_1(x), ..., f_n(x) be real integrable functions over the closed interval [a,b], then the determinant of their integrals satisfies

The Cartesian graph product G=G_1 square G_2, also called the graph box product and sometimes simply known as "the" graph product (Beineke and Wilson 2004, p. 104) and ...

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

The rank of a graph G is defined as r(G)=n-c, where n is the number of vertices on G and c is the number of connected components (Biggs 1993, p. 25).

A Gray code is an encoding of numbers so that adjacent numbers have a single digit differing by 1. The term Gray code is often used to refer to a "reflected" code, or more ...

The dual of the uniform great rhombicosidodecahedron U_(67) and Wenninger dual W_(105).

The dual of the uniform great rhombicuboctahedron and Wenninger dual W_(85).

The dual of the great dirhombicosidodecahedron U_(75) and Wenninger dual W_(119).