Search Results for ""
311 - 320 of 2903 for Minimum Total Dominating SetSearch Results
"Vertex" is a synonym for a node of a graph, i.e., one of the points on which the graph is defined and which may be connected by graph edges. The terms "point," "junction," ...
In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...
A principal bundle is a special case of a fiber bundle where the fiber is a group G. More specifically, G is usually a Lie group. A principal bundle is a total space E along ...
In a set X equipped with a binary operation · called a product, the multiplicative identity is an element e such that e·x=x·e=x for all x in X. It can be, for example, the ...
The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.
Determining the maximum number of pieces in which it is possible to divide a circle for a given number of cuts is called the circle cutting or pancake cutting problem. The ...
The Golay code is a perfect linear error-correcting code. There are two essentially distinct versions of the Golay code: a binary version and a ternary version. The binary ...
The function from a given nonempty set X to the power set P(X) that maps every element x of X to the set {x}.
The mathematical study of combinatorial objects in which a certain degree of order must occur as the scale of the object becomes large. Ramsey theory is named after Frank ...
The set of points, known as boundary points, which are members of the set closure of a given set S and the set closure of its complement set. The boundary is sometimes called ...
...
View search results from all Wolfram sites (39588 matches)

