Search Results for ""

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

A positive number k such that a lamina or solid body with moment of inertia about an axis I and mass m is given by I=mk^2. Pickover (1995) defines a generalization of k as a ...

Any set of n+2 points in R^n can always be partitioned in two subsets V_1 and V_2 such that the convex hulls of V_1 and V_2 intersect.

Ramsey's theorem is a generalization of Dilworth's lemma which states for each pair of positive integers k and l there exists an integer R(k,l) (known as the Ramsey number) ...

The Randić index of a graph is defined as half the sum of the matrix elements of its Randić matrix. While the index was introduced to model the branching of the carbon-atom ...

On a three-dimensional lattice, a random walk has less than unity probability of reaching any point (including the starting point) as the number of steps approaches infinity. ...

It is possible to find six points in the plane, no three on a line and no four on a circle (i.e., none of which are collinear or concyclic), such that all the mutual ...

A quotient of two polynomials P(z) and Q(z), R(z)=(P(z))/(Q(z)), is called a rational function, or sometimes a rational polynomial function. More generally, if P and Q are ...

Somos defines a rational triangle as a triangle such that all three sides measured relative to each other are rational. Koblitz (1993) defined a congruent number as an ...

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) ...