Search Results for ""

The 6-polyiamonds illustrated above.

Let S be a set of n+1 symbols, then a Howell design H(s,2n) on symbol set S is an s×s array H such that 1. Every cell of H is either empty or contains an unordered pair of ...

The central point in a wheel graph W_n. The hub has degree n-1.

A hypergraph is a graph in which generalized edges (called hyperedges) may connect more than two nodes.

A hyperstring is a simple semi-Hamiltonian acyclic digraph (V,E) with a labeling of the edges in E such that, for all vertices i,j,p,q in V, either pi(i,j)=pi(p,q) or pi(i,j) ...

The ratio of the independence number of a graph G to its vertex count is known as the independence ratio of G (Bollobás 1981). The product of the chromatic number and ...

A graph that is not finite is called infinite.

The intersection number omega(G) of a given graph G is the minimum number of elements in a set S such that G is an intersection graph on S.

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 ...

If p divides the numerator of the Bernoulli number B_(2k) for 0<2k<p-1, then (p,2k) is called an irregular pair. For p<30000, the irregular pairs of various forms are p=16843 ...