TOPICS
Search

Search Results for ""


1021 - 1030 of 2496 for Simple GraphSearch Results
The cyclic group C_(12) is one of the two Abelian groups of the five groups total of group order 12 (the other order-12 Abelian group being finite group C2×C6). Examples ...
C_3 is the unique group of group order 3. It is both Abelian and cyclic. Examples include the point groups C_3, C_(3v), and C_(3h) and the integers under addition modulo 3 ...
C_5 is the unique group of group order 5, which is Abelian. Examples include the point group C_5 and the integers mod 5 under addition (Z_5). No modulo multiplication group ...
C_6 is one of the two groups of group order 6 which, unlike D_3, is Abelian. It is also a cyclic. It is isomorphic to C_2×C_3. Examples include the point groups C_6 and S_6, ...
The cyclic group C_8 is one of the three Abelian groups of the five groups total of group order 8. Examples include the integers modulo 8 under addition (Z_8) and the residue ...
The cyclic group C_9 is one of the two Abelian groups of group order 9 (the other order-9 Abelian group being C_3×C_3; there are no non-Abelian groups of order 9). An example ...
An E_8 polytope is a polytope having the symmetry of the exceptional simple Lie groups E_8 of dimension 248. There are 255 uniform polytopes with E_8 symmetry in 8 ...
A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...
The minimum leaf number ml(G) of a connected graph G is the smallest number of tree leaves in any of its spanning trees. (The corresponding largest number of leaves is known ...
Consider the plane figure obtained by drawing each diagonal in a regular polygon. If each point of intersection is associated with a node and diagonals are split ar each ...
1 ... 100|101|102|103|104|105|106 ... 250 Previous Next

...