Search Results for ""

The (n,k)-arrangement graph A_(n,k) is defined as the graph on the vertex set consisting of the permutations of {1,2,...,n} containing at most k elements where vertices are ...

A black bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...

A chordless graph is a simple graph possessing no chords. A chordal graph (which possesses no chordless cycles) is not the same as (or converse of) a chordless graph (which ...

The term "continuum" has (at least) two distinct technical meanings in mathematics. The first is a compact connected metric space (Kuratowski 1968; Lewis 1983, pp. 361-394; ...

A topological space that is not connected, i.e., which can be decomposed as the disjoint union of two nonempty open subsets. Equivalently, it can be characterized as a space ...

The exponential transform is the transformation of a sequence a_1, a_2, ... into a sequence b_1, b_2, ... according to the equation ...

The radius of an excircle. Let a triangle have exradius r_A (sometimes denoted rho_A), opposite side of length a and angle A, area Delta, and semiperimeter s. Then r_1 = ...

The Georges graph, illustrated above, is 50-node graph which is the smallest currently known example of a 3-connected bicubic nonhamiltonian graph. It is implemented in the ...

The eccentricity epsilon(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all ...