Search Results for ""

A finite simple connected graph G is quadratically embeddable if its quadratic embedding constant QEC(G) is nonpositive, i.e., QEC(G)<=0. A graph being quadratically ...

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

Let G=(V,E) be a finite graph, let Omega be the set Omega={0,1}^E whose members are vectors omega=(omega(e):e in E), and let F be the sigma-algebra of all subsets of Omega. A ...

The set of fixed points which do not move as a knot is transformed into itself is not a knot. The conjecture was proved in 1978 (Morgan and Bass 1984). According to Morgan ...

Taylor's theorem states that any function satisfying certain conditions may be represented by a Taylor series, Taylor's theorem (without the remainder term) was devised by ...

The volume of a solid body is the amount of "space" it occupies. Volume has units of length cubed (i.e., cm^3, m^3, in^3, etc.) For example, the volume of a box (cuboid) of ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

The transformation of a sequence a_1, a_2, ... with a_n=sum_(d|n)b_d (1) into the sequence b_1, b_2, ... via the Möbius inversion formula, b_n=sum_(d|n)mu(n/d)a_d. (2) The ...

Anomalous cancellation is a "canceling" of digits of a and b in the numerator and denominator of a fraction a/b which results in a fraction equal to the original. Note that ...

The Abel prize is a new mathematics prize of the Norwegian Academy of Science and Letters, dedicated to the memory of Niels Henrik Abel (1802-1829) on the occasion of the ...