TOPICS
Search

Search Results for ""


1321 - 1330 of 2322 for Intersection_graphSearch Results
The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].
The Johnson circumconic, a term used here for the first time, is the circumconic that passes through the vertices of both the reference triangle and the Johnson triangle. It ...
Togliatti (1940, 1949) showed that quintic surfaces having 31 ordinary double points exist, although he did not explicitly derive equations for such surfaces. Beauville ...
A topological space, also called an abstract topological space, is a set X together with a collection of open subsets T that satisfies the four conditions: 1. The empty set ...
The 16-cell beta_4 is the finite regular four-dimensional cross polytope with Schläfli symbol {3,3,4}. It is also known as the hyperoctahedron (Buekenhout and Parker 1998) or ...
The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.
An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.
A geometric construction done with a movable compass alone. All constructions possible with a compass and straightedge are possible with a movable compass alone, as was ...
Two (or more) intersecting curves that are perpendicular at their intersection are said to be orthogonal.
The Betti numbers of a compact orientable n-manifold satisfy the relation b_i=b_(n-i).
1 ... 130|131|132|133|134|135|136 ... 233 Previous Next

...