Search Results for ""

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...

A planted tree is a rooted tree whose root vertex has vertex degree 1. The number of planted trees of n nodes is T_(n-1), where T_(n-1) is the number of rooted trees of n-1 ...

A Poisson process is a process satisfying the following properties: 1. The numbers of changes in nonoverlapping intervals are independent for all intervals. 2. The ...

The word population has a number of distinct but closely related meanings in statistics. 1. A finite and actually existing group of objects which, although possibly large, ...

The Q-chromatic polynomial, introduced by Birkhoff and Lewis (1946) and termed the "Q-chromial" by Bari (1974), is an alternate form of the chromatic polynomial pi(x) defined ...

The term "real line" has a number of different meanings in mathematics. Most commonly, "real line" is used to mean real axis, i.e., a line with a fixed scale so that every ...

A scale-free network is a connected graph or network with the property that the number of links k originating from a given node exhibits a power law distribution ...

A partition whose conjugate partition is equivalent to itself. The Ferrers diagrams corresponding to the self-conjugate partitions for 3<=n<=10 are illustrated above. The ...

A sparse matrix is a matrix that allows special techniques to take advantage of the large number of "background" (commonly zero) elements. The number of zeros a matrix needs ...

A stack polyomino is a self-avoiding convex polyomino containing two adjacent corners of its minimal bounding rectangle. The number of stack polyominoes with perimeter 2n+4 ...