Search Results for ""

The result of a matrix multiplication.

A minimal vertex cut is an vertex cut of a graph that is not a proper subset of any other vertex cut. Every minimum vertex cut is a minimal vertex cut, but the converse does ...

Monster-barring is a term coined by Lakatos (1976) to refer to the refining of a hypothesis to rule out nasty counterexamples (Bailey et al. 2007, p. 11).

A curve also known as swan-like curve or streamline. It is given by the polar equation r=atheta+b, where a>0.

If two curves phi and psi of multiplicities r_i!=0 and s_i!=0 have only ordinary points or ordinary singular points and cusps in common, then every curve which has at least ...

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

The symbol % used to indicate percent.

F(x,s) = sum_(m=1)^(infty)(e^(2piimx))/(m^s) (1) = psi_s(e^(2piix)), (2) where psi_s(x) is the polygamma function.

Members of a coaxal system satisfy x^2+y^2+2lambdax+c=(x+lambda)^2+y^2+c-lambda^2=0 for values of lambda. Picking lambda^2=c then gives the two circles (x+/-sqrt(c))^2+y^2=0 ...

The mathematical object kappa which controls the rate of geodesic deviation.