TOPICS
Search

Search Results for ""


1151 - 1160 of 2352 for Complete GraphSearch Results
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 16-cell beta_4 is the finite regular four-dimensional cross polytope with Schläfli symbol {3,3,4}. It is also known as the hyperoctahedron (Buekenhout and Parker 1998) or ...
Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person ...
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 ...
1 ... 113|114|115|116|117|118|119 ... 236 Previous Next

...