Search Results for ""

A Ferrers diagram represents partitions as patterns of dots, with the nth row having the same number of dots as the nth term in the partition. The spelling "Ferrars" (Skiena ...

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

Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...

In Season 4 episode "Black Swan" of the television crime drama NUMB3RS, the character Amita Ramanujan refers to graph entropies when studying a map of the Los Angeles while ...

A framework is called "just rigid" if it is rigid, but ceases to be so when any single bar is removed. Lamb (1928, pp. 93-94) proved that a necessary (but not sufficient) ...

A maximal independent set is an independent set which is a maximal set, i.e., an independent set that is not a subset of any other independent set. The generic term "maximal ...

A maximum spanning tree is a spanning tree of a weighted graph having maximum weight. It can be computed by negating the weights for each edge and applying Kruskal's ...

A minimum clique covering is a clique covering of minimum size, and the size of such a minimum clique covering is known as the clique covering number. Note that while a ...

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 pentakis icosidodecahedron is the dual of the chamfered dodecahedron. It contains 42 vertices, 120 edges, and 80 faces. The canonical version has two distinct edge ...