Search Results for ""

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...

The complex second-order ordinary differential equation x^2y^('')+xy^'-(ix^2+nu^2)y=0 (1) (Abramowitz and Stegun 1972, p. 379; Zwillinger 1997, p. 123), whose solutions can ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

The Laplacian spectral ratio R_L(G) of a connected graph G is defined as the ratio of its Laplacian spectral radius to its algebraic connectivity. If a connected graph of ...

To fit a functional form y=Ae^(Bx), (1) take the logarithm of both sides lny=lnA+Bx. (2) The best-fit values are then a = ...

The Lemoine hexagon is a cyclic hexagon with vertices given by the six concyclic intersections of the parallels of a reference triangle through its symmedian point K. The ...

The second-order ordinary differential equation y^('')+g(y)y^('2)+f(x)y^'=0 (1) is called Liouville's equation (Goldstein and Braun 1973; Zwillinger 1997, p. 124), as are the ...

There are several different kinds of magic numbers. The digital root and magic constant are sometimes known as magic numbers. In baseball, the magic number for a team in ...

The margin of error is an estimate of a confidence interval for a given measurement, result, etc. and is frequently cited in statistics. While phrases such as, "The poll has ...

The second-order ordinary differential equation x^2(d^2y)/(dx^2)+x(dy)/(dx)-(x^2+n^2)y=0. (1) The solutions are the modified Bessel functions of the first and second kinds, ...