Search Results for ""
1191 - 1200 of 2001 for Dominating Unique GraphsSearch Results

A trail is a walk v_0, e_1, v_1, ..., v_k with no repeated edge. The length of a trail is its number of edges. A u,v-trail is a trail with first vertex u and last vertex v, ...
The equilateral triaugmented triangular prism is the Johnson solid J_(51) constructed by erecting a regular tetrahedron on each square face of an equilateral triangular ...
An unfolding is the cutting along edges and flattening out of a polyhedron to form a net. Determining how to unfold a polyhedron into a net is tricky. For example, cuts ...
A web diagram, also called a cobweb plot, is a graph that can be used to visualize successive iterations of a function y=f(x). In particular, the segments of the diagram ...
The antilaplacian of u with respect to x is a function whose Laplacian with respect to x equals u. The antilaplacian is never unique.
A number of the form a_0+a_1zeta+...+a_(p-1)zeta^(p-1), where zeta=e^(2pii/p) is a de Moivre number and p is a prime number. Unique factorizations of cyclotomic integers fail ...
A field K is said to be an extension field (or field extension, or extension), denoted K/F, of a field F if F is a subfield of K. For example, the complex numbers are an ...
If a Sylow 2-subgroup T of G lies in a unique maximal 2-local P of G, then P is a "strongly embedded" subgroup of G, and G is known.
The unique 3-polyiamond, illustrated above.
The p-layer of H, L_(p^')(H) is the unique minimal normal subgroup of H which maps onto E(H/O_(p^')(H)).

...