Search Results for ""

A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

The Bowley skewness, also known as quartile skewness coefficient, is defied by ((Q_3-Q_2)-(Q_2-Q_1))/(Q_3-Q_1)=(Q_1-2Q_2+Q_3)/(Q_3-Q_1), where the Qs denote the interquartile ...

A method for testing nested hypotheses. To apply the procedure, given a specific model, calculate the likelihood of observing the actual data. Then compare this likelihood to ...

Given a statistical distribution with measured mean, mode, and standard deviation sigma, the Pearson mode skewness is (mean-mode)/sigma. The function was incorrectly ...

A graceful labeling (or graceful numbering) is a special graph labeling of a graph on m edges in which the nodes are labeled with a subset of distinct nonnegative integers ...

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

Cospectral graphs, also called isospectral graphs, are graphs that share the same graph spectrum. The smallest pair of isospectral graphs is the graph union C_4 union K_1 and ...

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

The Harary index of a graph G on n vertices was defined by Plavšić et al. (1993) as H(G)=1/2sum_(i=1)^nsum_(j=1)^n(RD)_(ij), (1) where (RD)_(ij)={D_(ij)^(-1) if i!=j; 0 if ...