Search Results for ""
231 - 240 of 3571 for Kirchhoffs Matrix Tree TheoremSearch Results
The converse of Fisher's theorem.
Frey's theorem states that every Abelian category is a subcategory of some category of modules over a ring. Mitchell (1964) has strengthened this, saying every Abelian ...
A type of mathematical result which is considered by most logicians as more natural than the metamathematical incompleteness results first discovered by Gödel. Finite ...
Let (a)_i be a sequence of complex numbers and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as f_(nk)=(product_(j=k)^(n-1)(a_j+k))/((n-k)!) and ...
Let p and q be partitions of a positive integer, then there exists a (0,1)-matrix A such that c(A)=p, r(A)=q iff q is dominated by p^*.
Proved in 1933. If q is an odd prime or q=0 and n is any positive integer, then there is a Hadamard matrix of order m=2^e(q^n+1), where e is any positive integer such that ...
The Kirchhoff sum index KfS is a graph index defined for a graph on n nodes by KfS=1/2sum_(i=1)^nsum_(j=1)^n((Omega)_(ij))/((d)_(ij)), where (Omega)_(ij) is the resistance ...
Let M_r be an r-rowed minor of the nth order determinant |A| associated with an n×n matrix A=a_(ij) in which the rows i_1, i_2, ..., i_r are represented with columns k_1, ...
The Wiener sum index WS is a graph index defined for a graph on n nodes by WS=1/2sum_(i=1)^nsum_(j=1)^n((d)_(ij))/((Omega)_(ij)), where (d)_(ij) is the graph distance matrix ...
A Julia set fractal obtained by iterating the function z_(n+1)=c(z_n-sgn(R[z_n])), where sgn(x) is the sign function and R[z] is the real part of z. The plot above sets ...
...
View search results from all Wolfram sites (23804 matches)

