Search Results for ""

The grouping of data into bins (spaced apart by the so-called class interval) plotting the number of members in each bin versus the bin number. The above histogram shows the ...

The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...

A partition {a_1,...,a_n} is called graphical if there exists a graph G having degree sequence {a_1,...,a_n}. The number of graphical partitions of length n is equal to the ...

An isolated point of a graph is a node of degree 0 (Hartsfield and Ringel 1990, p. 8; Harary 1994, p. 15; D'Angelo and West 2000, p. 212; West 2000, p. 22). The number of ...

A graphic sequence is a sequence of numbers which can be the degree sequence of some graph. A sequence can be checked to determine if it is graphic using GraphicQ[g] in the ...

The Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...

The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...

A quantitative measure of the simplicity of a geometric construction which reduces geometric constructions to five steps. It was devised by È. Lemoine. S_1 Place a ...

First-passage percolation is a time-dependent generalization of discrete Bernoulli percolation in which each graph edge e of Z^d is assigned a nonnegative random variable ...

The graph product denoted G-H and defined by the adjacency relations (gadjg^') or (g=g^' and hadjh^'). The graph lexicographic product is also known as the graph composition ...