Search Results for ""

The vertex height of a vertex v in a rooted tree is the number of edges on the longest downward path between v and a tree leaf. The height of the root vertex of a rooted tree ...

The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.

The horizontal line segment in the above figure appears to be shorter than the vertical line segment, despite the fact that it has the same length.

An auction in which the highest bidder wins but pays only the second-highest bid. This variation over the normal bidding procedure is supposed to encourage bidders to bid the ...

Let S be a set of simple polygonal obstacles in the plane, then the nodes of the visibility graph of S are just the vertices of S, and there is an edge (called a visibility ...

A set of identities involving n-dimensional visible lattice points was discovered by Campbell (1994). Examples include product_((a,b)=1; ...

A conjecture which treats the heights of points relative to a canonical class of a curve defined over the integers.

A modification of the Eberhart's conjecture proposed by Wagstaff (1983) which proposes that if q_n is the nth prime such that M_(q_n) is a Mersenne prime, then ...

A compact set W_infty with area mu(W_infty)=8/9(24)/(25)(48)/(49)...=pi/4 created by punching a square hole of length 1/3 in the center of a square. In each of the eight ...

Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.