Search Results for ""
631 - 640 of 2903 for Minimum Total Dominating SetSearch Results
The complement of a graph G, sometimes called the edge-complement (Gross and Yellen 2006, p. 86), is the graph G^', sometimes denoted G^_ or G^c (e.g., Clark and Entringer ...
An urelement contains no elements, belongs to some set, and is not identical with the empty set (Moore 1982, p. 3; Rubin 1967, p. 23). "Ur" is a German prefix which is ...
A Julia set with constant c chosen at the boundary of the Mandelbrot set (Branner 1989; Dufner et al. 1998, p. 225). The image above was computed using c=i.
A number x such that for all epsilon>0, there exists a member of the set y different from x such that |y-x|<epsilon. The topological definition of limit point P of A is that ...
A set in R^n which can be reduced to one of its points, say P, by a continuous deformation, is said to be contractible. The transformation is such that each point of the set ...
A Turing machine is a theoretical computing machine invented by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine consists of a ...
The portion of number theory concerned with expressing an integer as a sum of integers from some given set.
The backslash symbol \ is used to denote a set difference, quotient group, or integer division.
A portion of the Mandelbrot set centered around 0.3+0i with size approximately 0.1+0.1i.
The problem of finding all independent irreducible algebraic relations among any finite set of quantics.
...
View search results from all Wolfram sites (39588 matches)

