Search Results for ""
581 - 590 of 2903 for Minimum Total Dominating SetSearch Results
The Minkowski measure of a bounded, closed set is the same as its Lebesgue measure.
"The rationals" refers to the set of rational numbers and is commonly denoted Q.
A set of moves which a player plans to follow while playing a game.
Lachlan's term for a set of four lines, no three of which are concurrent.
Lachlan's term for a set of four points, no three of which are collinear.
A relation R on a set S is irreflexive provided that no element is related to itself; in other words, xRx for no x in S.
Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...
The braced square problem asks, given a hinged square composed of four equal rods (indicated by the red lines above), how many more hinged rods must be added in the same ...
Let X be a set and S a collection of subsets of X. A set function mu:S->[0,infty] is said to possess finite monotonicity provided that, whenever a set E in S is covered by a ...
A set which transforms via converse functions. Antisets usually arise in the context of Chu spaces.
...
View search results from all Wolfram sites (39588 matches)

