Search Results for ""

A sequence whose terms are integers. The most complete printed references for such sequences are Sloane (1973) and its update, Sloane and Plouffe (1995). Neil Sloane ...

An intrinsically linked graph is a graph having the property that any embedding of it in three dimensions contains a nontrivial link. A graph is intrinsically linked iff it ...

The notion of an inverse is used for many types of mathematical constructions. For example, if f:T->S is a function restricted to a domain S and range T in which it is ...

A system of coordinates obtained by inversion of the oblate spheroids and one-sheeted hyperboloids in oblate spheroidal coordinates. The inverse oblate spheroidal coordinates ...

The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...

The jinc function is defined as jinc(x)=(J_1(x))/x, (1) where J_1(x) is a Bessel function of the first kind, and satisfies lim_(x->0)jinc(x)=1/2. The derivative of the jinc ...

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 Landau-Mignotte bound, also known as the Mignotte bound, is used in univariate polynomial factorization to determine the number of Hensel lifting steps needed. It gives ...

The Laplace distribution, also called the double exponential distribution, is the distribution of differences between two independent variates with identical exponential ...

The Laplacian spectral radius of a finite graph is defined as the largest value of its Laplacian spectrum, i.e., the largest eigenvalue of the Laplacian matrix (Lin et al. ...