Search Results for ""
1471 - 1480 of 2186 for k Connected GraphSearch Results
Let K subset= C be compact, let f be analytic on a neighborhood of K, and let P subset= C^*\K contain at least one point from each connected component of C^*\K. Then for any ...
The salinon is the figure illustrated above formed from four connected semicircles. The word salinon is Greek for "salt cellar," which the figure resembles. If the radius of ...
A set S and a binary operator * are said to exhibit closure if applying the binary operator to two elements S returns a value which is itself a member of S. The closure of a ...
A shaky polyhedron is a non-rigid concave polyhedron which is only infinitesimally movable. Jessen's orthogonal icosahedron is a shaky polyhedron (Wells 1991).
A solvable Lie group is a Lie group G which is connected and whose Lie algebra g is a solvable Lie algebra. That is, the Lie algebra commutator series ...
A stack polyomino is a self-avoiding convex polyomino containing two adjacent corners of its minimal bounding rectangle. The number of stack polyominoes with perimeter 2n+4 ...
Define the minimal bounding rectangle as the smallest rectangle containing a given lattice polygon. If the perimeter of the lattice polygon is equal to that of its minimal ...
A recursive function devised by I. Takeuchi in 1978 (Knuth 1998). For integers x, y, and z, it is defined by (1) This can be described more simply by t(x,y,z)={y if x<=y; {z ...
Let L be a nontrivial bounded lattice (or a complemented lattice, etc.). Then L is a tight lattice if every proper tolerance rho of L satisfies (0,a) in rho=>a=0, and dually ...
A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems ...
...
View search results from all Wolfram sites (190815 matches)

