TOPICS
Search

Search Results for ""


1231 - 1240 of 3570 for Matrix Tree TheoremSearch Results
A fixed point for which the stability matrix has one zero eigenvector with negative eigenvalue lambda<0.
A fixed point for which the stability matrix has one zero eigenvector with positive eigenvalue lambda>0.
The complex conjugate of a complex number z=a+bi is defined to be z^_=a-bi. (1) The conjugate matrix of a matrix A=(a_(ij)) is the matrix obtained by replacing each element ...
Given a square n×n nonsingular integer matrix A, there exists an n×n unimodular matrix U and an n×n matrix H (known as the Hermite normal form of A) such that AU=H. ...
The Jordan canonical form, also called the classical canonical form, of a special type of block matrix in which each block consists of Jordan blocks with possibly differing ...
Gaussian elimination is a method for solving matrix equations of the form Ax=b. (1) To perform Gaussian elimination starting with the system of equations [a_(11) a_(12) ... ...
A short theorem used in proving a larger theorem. Related concepts are the axiom, porism, postulate, principle, and theorem. The late mathematician P. Erdős has often been ...
A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...
When referring to a planar object, "free" means that the object is regarded as capable of being picked up out of the plane and flipped over. As a result, mirror images are ...
The path graph P_n is a tree with two nodes of vertex degree 1, and the other n-2 nodes of vertex degree 2. A path graph is therefore a graph that can be drawn so that all of ...
1 ... 121|122|123|124|125|126|127 ... 357 Previous Next

...