Search Results for ""

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

The simple continued fraction of the Golomb-Dickman constant lambda is [0; 1, 1, 1, 1, 1, 22, 1, 2, 3, 1, 1, 11, ...] (OEIS A225336). Note that this continued fraction ...

For an undirected graph, an unordered pair of nodes that specify a line joining these two nodes are said to form an edge. For a directed graph, the edge is an ordered pair of ...

The graph tensor product, also called the graph cardinal product (Imrich 1998), graph categorical product, graph conjunction, graph direct product (Hammack et al. 2016), ...

In cylindrical coordinates, the scale factors are h_r=1, h_theta=r, h_z=1, so the Laplacian is given by del ...

The prime HP(n) reached starting from a number n, concatenating its prime factors, and repeating until a prime is reached. For example, for n=9, 9=3·3->33=3·11->311, so 311 ...

Lagrange multipliers, also called Lagrangian multipliers (e.g., Arfken 1985, p. 945), can be used to find the extrema of a multivariate function f(x_1,x_2,...,x_n) subject to ...

A polygon whose vertices are points of a point lattice. Regular lattice n-gons exists only for n=3, 4, and 6 (Schoenberg 1937, Klamkin and Chrestenson 1963, Maehara 1993). A ...

The second solution Q_l(x) to the Legendre differential equation. The Legendre functions of the second kind satisfy the same recurrence relation as the Legendre polynomials. ...

In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), NaN (or "not a number") is a symbolic floating-point representation which is neither a signed infinity nor ...