Search Results for ""

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

An algorithm similar to Neville's algorithm for constructing the Lagrange interpolating polynomial. Let f(x|x_0,x_1,...,x_k) be the unique polynomial of kth polynomial order ...

The hyperbolic cosine integral, often called the "Chi function" for short, is defined by Chi(z)=gamma+lnz+int_0^z(cosht-1)/tdt, (1) where gamma is the Euler-Mascheroni ...

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

An edge of a graph is said to be pendant if one of its vertices is a pendant vertex.