Search Results for ""

A fixed point for which the stability matrix has both eigenvalues positive, so lambda_1>lambda_2>0.

A fixed point for which the stability matrix has eigenvalues of the form lambda_+/-=alpha+/-ibeta (with alpha,beta>0).

A fixed point for which the stability matrix has one zero eigenvector with positive eigenvalue lambda>0.

A graph is said to be unswitchable if it cannot be reduced to another graph with the same degree sequence by edge-switching. Conversely, a graph that can be reduced to ...

An untouchable number is a positive integer that is not the sum of the proper divisors of any number. The first few are 2, 5, 52, 88, 96, 120, 124, 146, ... (OEIS A005114). ...

An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...

The upper-trimmed subsequence of x={x_n} is the sequence lambda(x) obtained by dropping the first occurrence of n for each n. If x is a fractal sequence, then lambda(x)=x.

A function f is said to have a upper bound C if f(x)<=C for all x in its domain. The least upper bound is called the supremum. A set is said to be bounded from above if it ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

The unit upper half-disk is the portion of the complex plane satisfying {|z|<=1,I[z]>0}.