Search Results for ""

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

The distance between two points is the length of the path connecting them. In the plane, the distance between points (x_1,y_1) and (x_2,y_2) is given by the Pythagorean ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

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