Search Results for ""
1491 - 1500 of 2179 for Gray graphSearch Results
A tree with its nodes labeled. The number of labeled trees on n nodes is n^(n-2), the first few values of which are 1, 1, 3, 16, 125, 1296, ... (OEIS A000272). Cayley (1889) ...
The number of empty neighbors of a cluster.
A sum over all cluster perimeters.
Define a valid "coloring" to occur when no two faces with a common edge share the same color. Given two colors, there is a single way to color an octahedron (Ball and Coxeter ...
A hyperbola (plural "hyperbolas"; Gray 1997, p. 45) is a conic section defined as the locus of all points P in the plane the difference of whose distances r_1=F_1P and ...
Minimal surfaces are defined as surfaces with zero mean curvature. A minimal surface parametrized as x=(u,v,h(u,v)) therefore satisfies Lagrange's equation, ...
A parabola (plural "parabolas"; Gray 1997, p. 45) is the set of all points in the plane equidistant from a given line L (the conic section directrix) and a given point F not ...
The Thue-Morse sequence, also called the Morse-Thue sequence or Prouhet-Thue-Morse sequence (Allouche and Cosnard 2000), is one of a number of related sequences of numbers ...
A tree which is not rooted, i.e., a normal tree with no node singled out for special treatment (Skiena 1990, p. 107). Free trees are sometimes known instead as unrooted trees ...
A Hasse diagram is a graphical rendering of a partially ordered set displayed via the cover relation of the partially ordered set with an implied upward orientation. A point ...
...
View search results from all Wolfram sites (15739 matches)

