Search Results for ""

C_4 is one of the two groups of group order 4. Like C_2×C_2, it is Abelian, but unlike C_2×C_2, it is a cyclic. Examples include the point groups C_4 (note that the same ...

A cyclic number is an (n-1)-digit integer that, when multiplied by 1, 2, 3, ..., n-1, produces the same digits in a different order. Cyclic numbers are generated by the full ...

A tag system in which a list of n tag rules (each of a special form) is applied to a system in sequential order and then starting again from the first rule. In a cyclic tag ...

The cyclotomic graph of order q with q a prime power is a graph on q nodes with two nodes adjacent if their difference is a cube in the finite field GF(q). This graph is ...

Find the figure bounded by a line which has the maximum area for a given perimeter. The solution is a semicircle. The problem is based on a passage from Virgil's Aeneid: "The ...

The dihedral group D_n is the symmetry group of an n-sided regular polygon for n>1. The group order of D_n is 2n. Dihedral groups D_n are non-Abelian permutation groups for ...

A dissection fallacy is an apparent paradox arising when two plane figures with different areas seem to be composed by the same finite set of parts. In order to produce this ...

In general, an extremal graph is the largest graph of order n which does not contain a given graph G as a subgraph (Skiena 1990, p. 143). Turán studied extremal graphs that ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

A partition {a_1,...,a_n} is called graphical if there exists a graph G having degree sequence {a_1,...,a_n}. The number of graphical partitions of length n is equal to the ...