Search Results for ""

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

For a connected graph G of graph diameter d, the distance-k graph G_k for k=1, ..., d is a graph with the same vertex set and having edge set consisting of the pairs of ...

The distinct prime factors of a positive integer n>=2 are defined as the omega(n) numbers p_1, ..., p_(omega(n)) in the prime factorization ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

The distribution function D(x), also called the cumulative distribution function (CDF) or cumulative frequency function, describes the probability that a variate X takes on a ...

The distribution parameter of a noncylindrical ruled surface parameterized by x(u,v)=sigma(u)+vdelta(u), (1) where sigma is the striction curve and delta the director curve, ...

A multiplication * is said to be right distributive if (x+y)z=xz+yz for every x, y, and z. Similarly, it is said to be left distributive if z(x+y)=zx+zy for every x, y, and ...

A lattice which satisfies the identities (x ^ y) v (x ^ z)=x ^ (y v z) (x v y) ^ (x v z)=x v (y ^ z) is said to be distributive.

The ditrigonal dodecadodecahedron, also called the ditrigonal dodecahedron, is the uniform polyhedron with Maeder index 41 (Maeder 1997), Wenninger index 80 (Wenninger 1989), ...

The ditrigonal icosidodecahedral graph is the skeleton of the cube 5-compound, ditrigonal dodecadodecahedron, great ditrigonalIcosidodecahedron, and small ditrigonal ...