Search Results for ""

The n-cycle complement graph C^__n is the graph complement of the cycle graph C_n. Cycle complement graphs are special cases of circulant graphs. The first few are ...

The discrete Fourier transform of length N (where N is even) can be rewritten as the sum of two discrete Fourier transforms, each of length N/2. One is formed from the ...

A (Delta,D)-graph is a graph with maximum vertex degree Delta and diameter at most D. The order of a graph with degree Delta of diameter D is bounded by ...

A search algorithm of a tree that explores the first child of a node before visiting its siblings. Tarjan (1972) and Hopcroft and Tarjan (1973) showed that depth-first search ...

A directed strongly regular graph is a simple directed graph with adjacency matrix A such that the span of A, the identity matrix I, and the unit matrix J is closed under ...

The double graph of a given graph G is constructed by making two copies of G (including the initial edge set of each) and adding edges u_1v_2 and v_1u_2 for every edge uv of ...

An edge cover is a subset of edges defined similarly to the vertex cover (Skiena 1990, p. 219), namely a collection of graph edges such that the union of edge endpoints ...

An encoding is a way of representing a number or expression in terms of another (usually simpler) one. However, multiple expressions can also be encoded as a single ...

A generalization of Turán's theorem to non-complete graphs.

The sum over all external (square) nodes of the lengths of the paths from the root of an extended binary tree to each node. For example, in the tree above, the external path ...