Search Results for ""
1151 - 1160 of 1975 for Skolem Graceful GraphSearch Results
A state diagram is a labeled directed graph together with state information that can be used to indicate that certain paths on in a system may be traversed only in a certain ...
For a given positive integer n, does there exist a weighted tree with n graph vertices whose paths have weights 1, 2, ..., (n; 2), where (n; 2) is a binomial coefficient? ...
The shortest circular sequence of length sigma^n such that every string of length n on the alphabet a of size sigma occurs as a contiguous subrange of the sequence described ...
A hexahedron is a polyhedron with six faces. The figure above shows a number of named hexahedra, in particular the acute golden rhombohedron, cube, cuboid, hemicube, ...
Arithmetic is the branch of mathematics dealing with integers or, more generally, numerical computation. Arithmetical operations include addition, congruence calculation, ...
An interpretation of first-order logic consists of a non-empty domain D and mappings for function and predicate symbols. Every n-place function symbol is mapped to a function ...
Arrange copies of the n digits 1, ..., n such that there is one digit between the 1s, two digits between the 2s, etc. For example, the unique (modulo reversal) n=3 solution ...
Combinatorial matrix theory is a rich branch of mathematics that combines combinatorics, graph theory, and linear algebra. It includes the theory of matrices with prescribed ...
C_7 is the cyclic group that is the unique group of group order 7. Examples include the point group C_7 and the integers modulo 7 under addition (Z_7). No modulo ...
The Goddard-Henning enneahedron, a term coined here, is the canonical polyhedron obtained from the Goddard-Henning graph. It has 9 vertices, 16 edges (consisting of 3 ...
...
View search results from all Wolfram sites (12546 matches)

