Search Results for ""
521 - 530 of 880 for Weakly Connected DigraphSearch Results
Let E be a simply connected compact set in the complex plane. By the Riemann mapping theorem, there is a unique analytic function ...
A covering map (also called a covering or projection) is a surjective open map f:X->Y that is locally a homeomorphism, meaning that each point in X has a neighborhood that is ...
The operation of drilling a tubular neighborhood of a knot K in S^3 and then gluing in a solid torus so that its meridian curve goes to a (p,q)-curve on the torus boundary of ...
In continuum theory, a dendrite is a locally connected continuum that contains no simple closed curve. A semicircle is therefore a dendrite, while a triangle is not. The term ...
The dihedral angle is the angle theta between two planes. The dihedral angle between the planes a_1x+b_1y+c_1z+d_1 = 0 (1) a_2x+b_2y+c_2z+d_2 = 0 (2) which have normal ...
For a connected graph G of graph diameter d, the distance-k graph G_k for k=1, ..., d is a graph with the same vertex set and having edge set consisting of the pairs of ...
The dominance relation on a set of points in Euclidean n-space is the intersection of the n coordinate-wise orderings. A point p dominates a point q provided that every ...
The domino is the unique free (and one-sided) 2-polyomino consisting of two equal squares connected along a complete polygon edge. There are two fixed dominoes.
A doublecross graph is a graph with graph crossing number 2. The numbers of doublecross simple graphs on n=1 nodes are 0, 0, 0, 0, 0, 1, 39, ..., and the numbers of connected ...
Let C be a smooth geometrically connected projective curve over F_q with q=p^s a prime power. Let infty be a fixed closed point of X but not necessarily F_q-rational. A ...
...
View search results from all Wolfram sites (185649 matches)

