Search Results for ""

An 8-polyiamond.

A type of binary tree.

The Reye graph is the transposition graph G_4 of order 4.

A bicubic nonhamiltonian graph is a bicubic (i.e., bipartite cubic graph) that is nonhamiltonian (i.e., that does not possess a Hamiltonian cycle). Tutte (1971) conjectured ...

The honeycomb toroidal graph HTG(m,2n,s) on 2nm vertices for m, n, and s positive integers satisfying n>1 and m+s is even is defined as the graph on vertex set u_(ij) for ...

The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture. Given two positive integers n and k, the Kneser graph K(n,k), often denoted ...

The adjacency list representation of a graph consists of n lists one for each vertex v_i, 1<=i<=n, which gives the vertices to which v_i is adjacent. The adjacency lists of a ...

Given a power spectrum (a plot of power vs. frequency), aliasing is a false translation of power falling in some frequency range (-f_c,f_c) outside the range. Aliasing is ...

A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...

A searching algorithm which works on a sorted table by testing the middle of an interval, eliminating the half of the table in which the key cannot lie, and then repeating ...