Search Results for ""

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

The Hoffman-Singleton graph is the graph on 50 nodes and 175 edges that is the only regular graph of vertex degree 7, diameter 2, and girth 5. It is the unique (7,5)-cage ...

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

Adomian polynomials decompose a function u(x,t) into a sum of components u(x,t)=sum_(n=0)^inftyu_n(x,t) (1) for a nonlinear operator F as F(u(x,t))=sum_(n=0)^inftyA_n. (2) ...

Using the notation of Byerly (1959, pp. 252-253), Laplace's equation can be reduced to (1) where alpha = cint_c^lambda(dlambda)/(sqrt((lambda^2-b^2)(lambda^2-c^2))) (2) = ...

In spherical coordinates, the scale factors are h_r=1, h_theta=rsinphi, h_phi=r, and the separation functions are f_1(r)=r^2, f_2(theta)=1, f_3(phi)=sinphi, giving a Stäckel ...

One or both of the square bracket symbols [ and ] are used in many different contexts in mathematics. 1. Square brackets are occasionally used in especially complex ...

sum_(i=1)^n((partialu)/(partialx_i))^2=1.

The Euler-Lagrange differential equation is the fundamental equation of calculus of variations. It states that if J is defined by an integral of the form J=intf(t,y,y^.)dt, ...

A function defined for all possible input values.