Search Results for ""

There are a number of graphs associated with J. H. Conway. The first is the unique rank-3 strongly regular graph with parameters (nu,k,lambda,mu)=(1408,567,246,216) with ...

The constant lambda=1.303577269034296... (OEIS A014715) giving the asymptotic rate of growth Clambda^n of the number of digits in the nth term of the look and say sequence, ...

The map projection having transformation equations x = (lambda-lambda_0)cosphi_s (1) y = sinphisecphi_s (2) for the normal aspect, where lambda is the longitude, lambda_0 is ...

The map projection having transformation equations x = (lambda-lambda_0)cosphi_1 (1) y = phi, (2) and the inverse formulas are phi = y (3) lambda = lambda_0+xsecphi_1, (4) ...

The equations are x = 2/(sqrt(pi(4+pi)))(lambda-lambda_0)(1+costheta) (1) y = 2sqrt(pi/(4+pi))sintheta, (2) where theta is the solution to ...

The equations are x = ((lambda-lambda_0)(1+costheta))/(sqrt(2+pi)) (1) y = (2theta)/(sqrt(2+pi)), (2) where theta is the solution to theta+sintheta=(1+1/2pi)sinphi. (3) This ...

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

In the Minkowski space of special relativity, a four-vector is a four-element vector x^mu=(x^0,x^1,x^2,x^3) that transforms under a Lorentz transformation like the position ...

The Higman-Sims graph is the unique strongly regular graph on 100 nodes (Higman and Sims 1968, Brouwer 1983, Brouwer and Haemers 1993). It was also constructed independently ...

Homogeneous coordinates (x_1,x_2,x_3) of a finite point (x,y) in the plane are any three numbers for which (x_1)/(x_3)=x (1) (x_2)/(x_3)=y. (2) Coordinates (x_1,x_2,0) for ...