TOPICS
Search

Search Results for ""


1321 - 1330 of 2496 for Simple GraphSearch Results
In 1850, Bravais demonstrated that crystals were comprised of 14 different types of unit cells: simple cubic, body-centered cubic, face-centered cubic; simple tetragonal, ...
The classification theorem of finite simple groups, also known as the "enormous theorem," which states that the finite simple groups can be classified completely into 1. ...
A finite simple group of Lie-type. The following table summarizes the types of twisted Chevalley groups and their respective orders. In the table, q denotes a prime power and ...
The bandwidth of a matrix M=(m_(ij)) is the maximum value of |i-j| such that m_(ij) is nonzero.
A tree spread in which each node has a finite number of children.
A theory of Hamiltonian cycles.
A relation R on a set S is transitive provided that for all x, y and z in S such that xRy and yRz, we also have xRz.
A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.
Edge splitting is the reverse of edge contraction.
An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).
1 ... 130|131|132|133|134|135|136 ... 250 Previous Next

...