Search Results for ""

A prime constellation, also called a prime k-tuple, prime k-tuplet, or prime cluster, is a sequence of k consecutive numbers such that the difference between the first and ...

A graph G having chromatic number chi(G)<=k is called a k-colorable graph (Harary 1994, p. 127). In contrast, a graph having chi(G)=k is said to be a k-chromatic graph. Note ...

A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on ...

A circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...

The Doyle graph, sometimes also known as the Holt graph (Marušič et al. 2005), is the quartic symmetric graph on 27 nodes illustrated above in several embeddings. It is ...

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

The Beatty sequence is a spectrum sequence with an irrational base. In other words, the Beatty sequence corresponding to an irrational number theta is given by |_theta_|, ...

The nesting of two or more functions to form a single new function is known as composition. The composition of two functions f and g is denoted f degreesg, where f is a ...

Given a sequence {a_n}_(n=1)^infty, a formal power series f(s) = sum_(n=1)^(infty)(a_n)/(n^s) (1) = a_1+(a_2)/(2^s)+(a_3)/(3^s)+... (2) is called the Dirichlet generating ...

An arc-transitive graph, sometimes also called a flag-transitive graph, is a graph whose graph automorphism group acts transitively on its graph arcs (Godsil and Royle 2001, ...