Search Results for ""

Multiple edges are two or more edges connecting the same two vertices within a multigraph. Multiple edges of degree d_(ij) between vertex i and vertex j correspond to an ...

A multiway system is a kind of substitution system in which multiple states are permitted at any stage. This accommodates rule systems in which there is more than one ...

Informally, a function f is a one-way function if 1. The description of f is publicly known and does not require any secret information for its operation. 2. Given x, it is ...

A d-dimensional discrete percolation model on a regular point lattice L=L^d is said to be oriented if L is an oriented lattice. One common such model takes place on the ...

A pair of elements (p_i,p_j) is called an inversion in a permutation p if i>j and p_i<p_j (Skiena 1990, p. 27; Pemmaraju and Skiena 2003, p. 69). For example, in the ...

A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...

A polyhedral nonhamiltonian graph is a graph that is simultaneously polyhedral and nonhamiltonian. The smallest possible number of vertices a nonhamiltonian polyhedral graph ...

As first shown by Meyer and Ritchie (1967), do-loops (which have a fixed iteration limit) are a special case of while-loops. A function that can be implemented using only ...

A quasi-cubic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...

A quintic graph is a graph which is 5-regular. The only quintic graph on n<=7 nodes is the complete graph K_6. Quintic graphs exist only on even numbers of nodes, and the ...