Search Results for ""

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...

"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...

A fixed point for which the stability matrix has both eigenvalues negative, 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 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).

The (n,k)-arrangement graph A_(n,k) is defined as the graph on the vertex set consisting of the permutations of {1,2,...,n} containing at most k elements where vertices are ...

Analytic continuation (sometimes called simply "continuation") provides a way of extending the domain over which a complex function is defined. The most common application is ...

The finite simple groups of Lie-type. They include four families of linear simple groups: PSL(n,q) (the projective special linear group), PSU(n,q) (the projective special ...