Search Results for ""
351 - 360 of 1536 for Small-World Network Average PathSearch Results
An algorithm which can be used to find a good, but not necessarily minimal, edge or vertex coloring for a graph. However, the algorithm does minimally color complete ...
The expression im kleinen is German and means "on a small scale." A topological space is connected im kleinen at a point x if every neighborhood U of x contains an open ...
A condition in numerical equation solving which states that, given a space discretization, a time step bigger than some computable quantity should not be taken. The condition ...
Also known as "Laplacian" determinant expansion by minors, expansion by minors is a technique for computing the determinant of a given square matrix M. Although efficient for ...
The dodecahedron has four stellations: the original dodecahedron, small stellated dodecahedron, great dodecahedron, and great stellated dodecahedron (Wenninger 1989, pp. 35 ...
A device consisting of two coupled pendula, usually oscillating at right angles to each other, which are attached to a pen. The resulting motion can produce beautiful, ...
A k×m×n hexagonal grid graph is a graph of adjoined hexagons consisting of k hexagons along the horizontal triangular axis, m along the northeast axis, and n along the ...
If P(z) is a power series which is regular for |z|<=1 except for m poles within this circle and except for z=+1, at which points the function is assumed continuous when only ...
The n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters . The 1-Pasechnik is ...
The term "porism" is an archaic type of mathematical proposition whose historical purpose is not entirely known. It is used instead of "theorem" by some authors for a small ...
...
View search results from all Wolfram sites (167717 matches)

