Search Results for ""

Two knots are pass equivalent if there exists a sequence of pass moves taking one to the other. Every knot is either pass equivalent to the unknot or trefoil knot. These two ...

The n-path complement graph P^__n is the graph complement of the path graph P_n. The first few are illustrated above. Since P_4 is self-complementary, P^__4 is isomorphic to ...

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a path polynomial whose coefficients are the numbers of paths of ...

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

The Patterson graph is the graph whose vertices are the 22880 centers of the Sylow 3-groups of the Suzuki group and in which two vertices are adjacent whenever they generate ...

Given an integer e>=2, the Payam number E_+/-(e) is the smallest positive odd integer k such that for every positive integer n, the number k·2^n+/-1 is not divisible by any ...

The theory of natural numbers defined by the five Peano's axioms. Paris and Harrington (1977) gave the first "natural" example of a statement which is true for the integers ...

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 skewed distribution which is similar to the binomial distribution when p!=q (Abramowitz and Stegun 1972, p. 930). y=k(t+A)^(A^2-1)e^(-At), (1) for t in [0,infty) where A = ...

Given a statistical distribution with measured mean, statistical median, mode, and standard deviation sigma, Pearson's first skewness coefficient, also known as the Pearson ...