Search Results for ""

MANOVA ("multiple analysis of variance") is a procedure for testing the equality of mean vectors of more than two populations. The technique is analogous to ANOVA for ...

Define a pebbling move as a transer of two pebbles from one vertex of a graph edge to an adjacent vertex with one of the pebbles being removed in transit as a toll. The ...

The chromatic polynomial pi_G(z) of an undirected graph G, also denoted C(G;z) (Biggs 1973, p. 106) and P(G,x) (Godsil and Royle 2001, p. 358), is a polynomial which encodes ...

A graph vertex in a graph is said to be an odd node if its vertex degree is odd.

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

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...

As proposed by Hosoya (1971), the Hosoya index (also called Z-index) of a graph is defined by Z = sum_(k=0)^(n)|a_k| (1) = sum_(k=0)^(n)b_k, (2) where n is the number of ...

A fullerene is a cubic polyhedral graph having all faces 5- or 6-cycles. Examples include the 20-vertex dodecahedral graph, 24-vertex generalized Petersen graph GP(12,2), ...

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.