Search Results for ""

Tracing through the connections of a branchial graph gives rise to the notion of a kind of space in which states on different branches of history are laid out. In particular, ...

A random-connection model (RCM) is a graph-theoretic model of continuum percolation theory characterized by the existence of a stationary point process X and a non-increasing ...

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 maximal irredundant set is an irredundant set that cannot be expanded to another irredundant set by addition of any vertex in the graph. Note that a maximal irredundant set ...

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

Two nonisomorphic graphs that have equal resistance spectra (i.e., multisets of resistance distances) are said to be resistance-equivalent. All nonisomorphic simple graphs on ...

A cube 9-compound can be constructed from the vertices of the first dodecahedron 2-compound. It will be implemented in a future version of the Wolfram Language as ...

A Pareto plot is type of plot used in quality control applications that combines a bar chart displaying percentages of categories in the data with a line graph showing ...

The tetragonal trapezohedron is the dual of the square antiprism. For a square antiprism with unit edge lengths, the edge lengths of the corresponding tetragonal ...

In general, the word "complement" refers to that subset F^' of some set S which excludes a given subset F. Taking F and its complement F^' together then gives the whole of ...