Search Results for ""

Two nonisomorphic graphs are said to be chromatically equivalent (also termed "chromically equivalent by Bari 1974) if they have identical chromatic polynomials. A graph that ...

A circular embedding is a graph embedding in which all graph vertices lie on a common circle, usually arranged so they are equally spaced around the circumference. Specific ...

A function H that maps an arbitrary length message M to a fixed length message digest MD is a collision-free hash function if 1. It is a one-way hash function. 2. It is hard ...

Let m(G) be the cycle rank of a graph G, m^*(G) be the cocycle rank, and the relative complement G-H of a subgraph H of G be defined as that subgraph obtained by deleting the ...

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

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