Search Results for ""

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

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

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

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

In complex analysis, a branch (also called a sheet) is a portion of the range of a multivalued function over which the function is single-valued. Combining all the sheets ...