Search Results for ""

For any alpha in A (where A denotes the set of algebraic numbers), let |alpha|^_ denote the maximum of moduli of all conjugates of alpha. Then a function ...

The great rhombicuboctahedral graph is the cubic Archimedean graph on 48 nodes and 72 edges that is the skeleton of the great rhombicuboctahedron as well as the great ...

A Lucas cube graph of order n is a graph that can be defined based on the n-Fibonacci cube graph by forbidding vertex strings that have a 1 both in the first and last ...

The n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters . The 1-Pasechnik is ...

A hash function H projects a value from a set with many (or even an infinite number of) members to a value from a set with a fixed number of (fewer) members. Hash functions ...

The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...

The Brouwer-Haemers graph is the unique strongly regular graph on 81 vertices with parameters nu=81, k=20, lambda=1, mu=6 (Brouwer and Haemers 1992, Brouwer). It is also ...

A graph with projective plane crossing number equal to 0 may be said to be projective planar. Examples of projective planar graphs with graph crossing number >=2 include the ...

A pairing function is a function that reversibly maps Z^*×Z^* onto Z^*, where Z^*={0,1,2,...} denotes nonnegative integers. Pairing functions arise naturally in the ...

The Ionin-Kharaghani graph is a strongly regular graph on 765 vertices and 73440 edges. It has regular parameters (nu,k,lambda,mu)=(765,192,48,48). It is implemented in the ...