TOPICS
Search

Search Results for ""


1 - 10 of 113 for nodeSearch Results
A fixed point for which the stability matrix has both eigenvalues of the same sign (i.e., both are positive or both are negative). If lambda_1<lambda_2<0, then the node is ...
A fixed point for which the stability matrix has equal nonzero eigenvectors.
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 both eigenvalues positive, so lambda_1>lambda_2>0.
A fixed point for which the stability matrix has equal negative eigenvalues.
A fixed point for which the stability matrix has equal positive eigenvalues.
A graph for which every node has finite degree.
A node which is one graph edge further away from a given node in a rooted tree.
A tree spread in which each node has a finite number of children.
A directed graph is called an arborescence if, from a given node x known as the root vertex, there is exactly one elementary path from x to every other node y.
1|2|3|4 ... 12 Next

...