Search Results for ""

Consider the problem of comparing two real numbers x and y based on their continued fraction representations. Then the mean number of iterations needed to determine if x<y or ...

The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...

A regularly spaced array of points in a square array, i.e., points with coordinates (m,n,...), where m, n, ... are integers. Such an array is often called a grid or mesh, and ...

Pre-Algebra

For a given positive integer n, does there exist a weighted tree with n graph vertices whose paths have weights 1, 2, ..., (n; 2), where (n; 2) is a binomial coefficient? ...

A Hamiltonian graph, also called a Hamilton graph, is a graph possessing a Hamiltonian cycle. A graph that is not Hamiltonian is said to be nonhamiltonian. A Hamiltonian ...

The (weak) Bruhat graph B_n of order n is the simple graph having have all permutations of {1,2,...,n} as vertices, and with an edge between pairs of permutations that differ ...

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

There are a number of meanings for the word "arc" in mathematics. In general, an arc is any smooth curve joining two points. The length of an arc is known as its arc length. ...

Discrete Mathematics