Search Results for ""

A circuit in which an entire graph is traversed in one route. Examples of curves that can be traced unicursally are the Mohammed sign and unicursal hexagram. The numbers of ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p) and numbers are assigned to the edges of a grid. A b-cluster is an ...

The stability index Z^_(G) of a graph G is defined by Z^_=sum_(k=0)^(|_n/2_|)|c_(2k)|, where c_k is the kth coefficient of the characteristic polynomial and |_n_| denotes the ...

Two distinct theorems are referred to as "the de Bruijn-Erdős theorem." One of them (de Bruijn and Erdős 1951) concerns the chromatic number of infinite graphs; the other (de ...

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

A node which is one graph edge further away from a given node in a rooted tree.

A hypergraph is a graph in which generalized edges (called hyperedges) may connect more than two nodes.

A minimum edge cut of a graph is an edge cut of smallest possible size. The size of a minimum edge cut in a connected graph G is called the graph's edge connectivity ...

An odd chordless cycle is a chordless cycle of length >4. A graph is said to be perfect iff neither the graph G nor its graph complement G^_ has an odd chordless cycle. A ...

An ordered pair representation is a representation of a directed graph in which edges are specified as ordered pairs or vertex indices. The ordered pairs representation of a ...