Search Results for ""

In physics, the word entropy has important physical implications as the amount of "disorder" of a system. In mathematics, a more abstract definition is used. The (Shannon) ...

A heptahedral graph is a polyhedral graph on seven nodes. There are 34 nonisomorphic heptahedral graphs, as first enumerated by Kirkman (1862-1863) and Hermes (1899ab, 1900, ...

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...

A New Kind of Science is a seminal work on simple programs by Stephen Wolfram. In 1980, Wolfram's studies found unexpected behavior in a collection of simple computer ...

A square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, ...

sum_(k=0)^dr_k^B(d-k)!x^k=sum_(k=0)^d(-1)^kr_k^(B^_)(d-k)!x^k(x+1)^(d-k).

A trail is a walk v_0, e_1, v_1, ..., v_k with no repeated edge. The length of a trail is its number of edges. A u,v-trail is a trail with first vertex u and last vertex v, ...

In discrete percolation theory, bond percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice graph ...

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...