Search Results for ""
371 - 380 of 880 for Weakly Connected DigraphSearch Results
Let X be a continuum (i.e., a compact connected metric space). Then X is hereditarily unicoherent provided that every subcontinuum of X is unicoherent. Any hereditarily ...
A hexagrammic prism is a prism formed by two regular hexagrams offset along their symmetry axis and with corresponding edges connected by lateral faces. For an equilateral ...
A homology class in a singular homology theory is represented by a finite linear combination of geometric subobjects with zero boundary. Such a linear combination is ...
If f_1,...,f_m:R^n->R are exponential polynomials, then {x in R^n:f_1(x)=...f_n(x)=0} has finitely many connected components.
An integer kappa equal to 0 or 1 which vanishes iff the product manifold M^4×R can be given a smooth structure. Here, M^n is a compact connected topological four-manifold.
The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...
The four planes determined by the four altitudes of a tetrahedron and the orthocenters of the corresponding faces pass through the Monge point of the tetrahedron.
The minimum leaf number ml(G) of a connected graph G is the smallest number of tree leaves in any of its spanning trees. (The corresponding largest number of leaves is known ...
A octagrammic prism is a prism formed by two regular octagrams offset along their symmetry axis and with corresponding edges connected by lateral faces. For an equilateral ...
A broad area of mathematics connected with functional analysis, differential equations, index theory, representation theory, and mathematical physics.
...
View search results from all Wolfram sites (185649 matches)

