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

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

Let a discrete distribution have probability function p_k, and let a second discrete distribution have probability function q_k. Then the relative entropy of p with respect ...

The root separation (or zero separation) of a polynomial P(x) with roots r_1, r_2, ... is defined by Delta(P)=min_(i!=j)|r_i-r_j|. There are lower bounds on how close two ...

A rounded rectangle is the shape obtained by taking the convex hull of four equal circles of radius r and placing their centers at the four corners of a rectangle with side ...

Let f be analytic on the unit disk, and assume that 1. |f(z)|<=1 for all z, and 2. f(a)=b for some a,b in D(0,1), the unit disk. Then |f^'(a)|<=(1-|b|^2)/(1-|a|^2). (1) ...

A smooth manifold M=(M,g) is said to be semi-Riemannian if the indexMetric Tensor Index of g is nonzero. Alternatively, a smooth manifold is semi-Riemannian provided that it ...

The metric tensor g on a smooth manifold M=(M,g) is said to be semi-Riemannian if the index of g is nonzero. In nearly all literature, the term semi-Riemannian is used ...

A spherical sector is a solid of revolution enclosed by two radii from the center of a sphere. The spherical sector may either be "open" and have a conical hole (left figure; ...

Let a Cevian PC be drawn on a triangle DeltaABC, and denote the lengths m=PA^_ and n=PB^_, with c=m+n. Then Stewart's theorem, also called Apollonius' theorem, states that ...