TOPICS
Search

Search Results for ""


631 - 640 of 3570 for Matrix Tree TheoremSearch Results
A fixed point for which the stability matrix has eigenvalues of the form lambda_+/-=alpha+/-ibeta (with alpha,beta>0).
The term "lobster" is used to refer either to a particular polyiamond or to a class of tree called a lobster graph. When referring to polyiamonds, the lobster is the ...
An m×1 matrix [a_(11); a_(21); |; a_(m1)].
A 1×n matrix [a_(11) a_(12) ... a_(1n)].
The sum over all external (square) nodes of the lengths of the paths from the root of an extended binary tree to each node. For example, in the tree above, the external path ...
Given an m×n matrix A and a p×q matrix B, their Kronecker product C=A tensor B, also called their matrix direct product, is an (mp)×(nq) matrix with elements defined by ...
A directed strongly regular graph is a simple directed graph with adjacency matrix A such that the span of A, the identity matrix I, and the unit matrix J is closed under ...
Vince and Bóna (2012) define an assembly tree T for a connected simple graph G on n nodes as a binary rooted tree with n leavesTree Leaf and n-1 internal nodes and satisfying ...
Specifying three sides uniquely determines a triangle whose area is given by Heron's formula, K=sqrt(s(s-a)(s-b)(s-c)), (1) where s=1/2(a+b+c) (2) is the semiperimeter of the ...
The point of coincidence of P and P^' in Fagnano's theorem.
1 ... 61|62|63|64|65|66|67 ... 357 Previous Next

...