Search Results for ""

The Randić spectral radius rho_(Randic) of a graph is defined as the largest eigenvalue of its Randić matrix.

If f:D->Y is a map (a.k.a. function, transformation, etc.) over a domain D, then the range of f, also called the image of D under f, is defined as the set of all values that ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

The quotient space K^__1A=K_1A/{0,[-1]} of the Whitehead group K_1A is known as the reduced Whitehead group. Here, the element [-1] in K_1A denotes the order-2 element ...

In the 1930s, Reidemeister first rigorously proved that knots exist which are distinct from the unknot. He did this by showing that all knot deformations can be reduced to a ...

The consideration of the result of a numerical calculation as a function of an adjustable parameter (usually the step size). The function can then be fitted and evaluated at ...

Let a closed interval [a,b] be partitioned by points a<x_1<x_2<...<x_(n-1)<b, where the lengths of the resulting intervals between the points are denoted Deltax_1, Deltax_2, ...

In a noncommutative ring R, a right ideal is a subset I which is an additive subgroup of R and such that for all r in R and all a in I, ar in I. (1) For all a in R, the set ...

Given a map f:S->T between sets S and T, the map g:T->S is called a right inverse to f provided that f degreesg=id_T, that is, composing f with g from the right gives the ...