Search Results for ""
651 - 660 of 3571 for Kirchhoffs Matrix Tree TheoremSearch Results
The identity _2F_1(x,-x;x+n+1;-1)=(Gamma(x+n+1)Gamma(1/2n+1))/(Gamma(x+1/2n+1)Gamma(n+1)), or equivalently ...
The sequence {F_n-1} is complete even if restricted to subsequences which contain no two consecutive terms, where F_n is a Fibonacci number.
Let a tree S be a subgraph of a cubic graph G. The graph excision G circleminus S is the graph resulting from removing the tree, then merging the edges. For example, if in ...
A Halin graph, sometimes known as a roofless polyhedron, is a polyhedral graph constructed from a planar embedding of a tree having four or more vertices, no vertices of ...
If the sides of a triangle are divided in the ratios lambda:1, mu:1, and nu:1, the cevians form a central triangle whose area is ...
A pseudoinverse is a matrix inverse-like object that may be defined for a complex matrix, even if it is not necessarily square. For any given complex matrix, it is possible ...
int_a^b(del f)·ds=f(b)-f(a), where del is the gradient, and the integral is a line integral. It is this relationship which makes the definition of a scalar potential function ...
Given three circles, each intersecting the other two in two points, the line segments connecting their points of intersection satisfy (ace)/(bdf)=1 (Honsberger 1995).
An a×b rectangle can be packed with 1×n strips iff n|a or n|b.
Let E and F be paired spaces with S a family of absolutely convex bounded sets of F such that the sets of S generate F and, if B_1,B_2 in S, there exists a B_3 in S such that ...
...
View search results from all Wolfram sites (23804 matches)

