Search Results for ""

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

The number of equivalent hyperspheres in n dimensions which can touch an equivalent hypersphere without any intersections, also sometimes called the Newton number, contact ...

The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture. Given two positive integers n and k, the Kneser graph K(n,k), often denoted ...

Let X be an arbitrary topological space. Denote the set closure of a subset A of X by A^- and the complement of A by A^'. Then at most 14 different sets can be derived from A ...

Let S(x) denote the number of positive integers not exceeding x which can be expressed as a sum of two squares (i.e., those n<=x such that the sum of squares function ...

The Laplace transform is an integral transform perhaps second only to the Fourier transform in its utility in solving physical problems. The Laplace transform is particularly ...

The logarithmic integral (in the "American" convention; Abramowitz and Stegun 1972; Edwards 2001, p. 26), is defined for real x as li(x) = {int_0^x(dt)/(lnt) for 0<x<1; ...

Nonstandard analysis is a branch of mathematical logic which introduces hyperreal numbers to allow for the existence of "genuine infinitesimals," which are numbers that are ...

A polygonal number is a type of figurate number that is a generalization of triangular, square, etc., to an n-gon for n an arbitrary positive integer. The above diagrams ...

The product of primes p_n#=product_(k=1)^np_k, (1) with p_n the nth prime, is called the primorial function, by analogy with the factorial function. Its logarithm is closely ...