Search Results for ""

The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...

An automorphism is an isomorphism of a system of objects onto itself. The term derives from the Greek prefix alphaupsilontauomicron (auto) "self" and ...

In plane geometry, a chord is the line segment joining two points on a curve. The term is often used to describe a line segment whose ends lie on a circle. The term is also ...

A bar graph is any plot of a set of data such that the number of data elements falling within one or more categories is indicated using a rectangle whose height or width is a ...

The diagonal of a polyhedron is any line segment connecting two nonadjacent vertices of the polyhedron. Any polyhedron having no diagonals must have a skeleton which is a ...

The Icosian game, also called the Hamiltonian game (Ball and Coxeter 1987, p. 262), is the problem of finding a Hamiltonian cycle along the edges of an dodecahedron, i.e., a ...

The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

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