TOPICS
Search

Search Results for ""


1381 - 1390 of 2186 for k Connected GraphSearch Results
A ternary tree is a tree-like structure that is rooted and in which each vertex has at most three children.
A sequence of moves (i.e., a path) on a chessboard by a chess piece in which each square of a chessboard is visited exactly once.
A tree having an infinite number of branches and whose nodes are sequences generated by a set of rules.
The de Grey-Haugstrup graphs are two 6-chromatic graphs on 47 and 48 vertices that are unit-distance in 3 dimensions (de Grey and Haugstrup 2020).
If f(z) is analytic in some simply connected region R, then ∮_gammaf(z)dz=0 (1) for any closed contour gamma completely contained in R. Writing z as z=x+iy (2) and f(z) as ...
A method of computing the determinant of a square matrix due to Charles Dodgson (1866) (who is more famous under his pseudonym Lewis Carroll). The method is useful for hand ...
The term domain has (at least) three different meanings in mathematics. The term domain is most commonly used to describe the set of values D for which a function (map, ...
Two oriented knots (or links) can be summed by placing them side by side and joining them by straight bars so that orientation is preserved in the sum. The knot sum is also ...
Let E be a compact connected subset of d-dimensional Euclidean space. Gross (1964) and Stadje (1981) proved that there is a unique real number a(E) such that for all x_1, ...
Let (K,L) be a pair consisting of finite, connected CW-complexes where L is a subcomplex of K. Define the associated chain complex C(K,L) group-wise for each p by setting ...
1 ... 136|137|138|139|140|141|142 ... 219 Previous Next

...