Search Results for ""

Let j_k(alpha) denote the number of cycles of length k for a permutation alpha expressed as a product of disjoint cycles. The cycle index Z(X) of a permutation group X of ...

A graph is a forbidden (vertex-)induced subgraph if its presence as a vertex-induced subgraph of a given graph means it is not a member of some family of graphs. For example, ...

Two graphs are homeomorphic if there is a graph isomorphism from some graph subdivision of one to some subdivision of the other.

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

Two subspaces S_1 and S_2 of R^n are said to be orthogonal if the dot product v_1·v_2=0 for all vectors v_1 in S_1 and all v_2 in S_2.

A unit-distance embedding is a graph embedding in which all edges have unit length. A graph possessing a unit-distance embedding in two dimensions is called a unit-distance ...

Dyads extend vectors to provide an alternative description to second tensor rank tensors. A dyad D(A,B) of a pair of vectors A and B is defined by D(A,B)=AB. The dot product ...

Define the zeta function of a variety over a number field by taking the product over all prime ideals of the zeta functions of this variety reduced modulo the primes. Hasse ...

The Cox configuration is a (2^(d-1))_d configuration whose Levi graph is the d-hypercube graph.

Let G(V,E) be a graph with graph vertices V and graph edges E on n graph vertices without a (k+1)-clique. Then t(n,k)<=((k-1)n^2)/(2k), where t(n,k) is the edge count. (Note ...