Search Results for ""

A fixed point for which the stability matrix has equal nonzero eigenvectors.

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

An angle which is not a right angle or a multiple of a right angle.

The continuous image of a Polish space, also called an analytic set.

Let c_k be the number of vertex covers of a graph G of size k. Then the vertex cover polynomial Psi_G(x) is defined by Psi_G(x)=sum_(k=0)^(|G|)c_kx^k, (1) where |G| is the ...

The inverse curve of the Archimedean spiral r=atheta^(1/n) with inversion center at the origin and inversion radius k is the Archimedean spiral r=k/atheta^(-1/n).

A glome is a 4-sphere (in the geometer's sense of the word) x^2+y^2+z^2+w^2=r^2 (as opposed to the usual 3-sphere). The term derives from the Latin "glomus" meaning "ball of ...

The thickness (or depth) t(G) (Skiena 1990, p. 251; Beineke 1997) or theta(G) (Harary 1994, p. 120) of a graph G is the minimum number of planar edge-induced subgraphs P_i of ...

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...

The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...