Search Results for ""

The Thompson group is the sporadic group Th of order |Th| = 90745943887872000 (1) = 2^(15)·3^(10)·5^3·7^2·13·19·31. (2) It is implemented in the Wolfram Language as ...

A trail is a walk v_0, e_1, v_1, ..., v_k with no repeated edge. The length of a trail is its number of edges. A u,v-trail is a trail with first vertex u and last vertex v, ...

The Trott curve is a simple example of a quartic curve having 28 real bitangents-the maximum possible for a quartic-given by the equation ...

Except for triangles, every simple polygon has at least two nonoverlapping ears.

A graph in which individual nodes have no distinct identifications except through their interconnectivity. Graphs in which labels (which are most commonly numbers) are ...

A "visual representation" number which is a sum of some simple function of its digits. For example, 1233 = 12^2+33^2 (1) 2661653 = 1653^2-266^2 (2) 221859 = 22^3+18^3+59^3 ...

A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair of vertices is equivalent under some element ...

Let S be a set of simple polygonal obstacles in the plane, then the nodes of the visibility graph of S are just the vertices of S, and there is an edge (called a visibility ...

A weakly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

Given a succession of nonsingular points which are on a nonhyperelliptic curve of curve genus p, but are not a group of the canonical series, the number of groups of the ...