TOPICS
Search

Search Results for ""


571 - 580 of 880 for Weakly Connected DigraphSearch Results
Tiling of a Möbius strip can be performed immediately by carrying over a tiling of a rectangle with the same two-sided surface area. However, additional tilings are possible ...
The point of concurrence of the six planes in Monge's tetrahedron theorem.
The six planes through the midpoints of the edges of a tetrahedron and perpendicular to the opposite edges concur in a point known as the Monge point.
If a complex function f is analytic in a disk contained in a simply connected domain D and f can be analytically continued along every polygonal arc in D, then f can be ...
A multistable polyhedron is a polyhedron that can change form from one stable configuration to another with only a slight transient nondestructive elastic stretch (Goldberg ...
A nilpotent Lie group is a Lie group G which is connected and whose Lie algebra is a nilpotent Lie algebra g. That is, its Lie algebra lower central series ...
A noneulerian graph is a graph that is not Eulerian. The numbers of simple noneulerian graphs on n=1, 2, ... nodes are 2, 3, 10, 30, 148, 1007, 12162, 272886, ... (OEIS ...
The term "null graph" is used both to refer to any empty graph and to the empty graph on 0 nodes. Because of the conflicting usage, it is probably best to avoid use of the ...
An octic graph is a regular graph of degree eight. The numbers of simple octic graphs on n=9, 10, 11, ... nodes are 1, 6, 94, 10786, 3459386, ... (OEIS A014378). Examples are ...
An oriented graph is a directed graph having no symmetric pair of directed edges. A complete oriented graph is called a tournament. The numbers of oriented graphs on n=1, 2, ...
1 ... 55|56|57|58|59|60|61 ... 88 Previous Next

...