Search Results for ""

The radius of a graph is the minimum graph eccentricity of any graph vertex in a graph. A disconnected graph therefore has infinite radius (West 2000, p. 71). Graph radius is ...

The notion of height is defined for proper ideals in a commutative Noetherian unit ring R. The height of a proper prime ideal P of R is the maximum of the lengths n of the ...

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

Seymour conjectured that a graph G of order n with minimum vertex degree delta(G)>=kn/(k+1) contains the kth graph power of a Hamiltonian cycle, generalizing Pósa's ...

The set theory symbol (aleph) for the cardinal number of a well-orderable infinite set.

A partially ordered set P is a circle order if it is isomorphic to a set of disks ordered by containment.

A function f:A->B such that B is a set of numbers.

A set of four, also called a quartet.

A set with three elements.

The circumcenter of mass is a concept that can be defined by analogy with one of the the constructions for the geometric centroid for the case of polygons. The geometric ...