Search Results for ""
1741 - 1750 of 3571 for Kirchhoffs Matrix Tree TheoremSearch Results
View search results from all Wolfram sites (23804 matches)1. A straight line segment can be drawn joining any two points. 2. Any straight line segment can be extended indefinitely in a straight line. 3. Given any straight line ...
Two submanifolds X and Y in an ambient space M intersect transversally if, for all p in X intersection Y, TX_p+TY_p={v+w:v in TX_p,w in TY_p}=TM_p, where the addition is in ...
The above two figures are rearrangements of each other, with the corresponding triangles and polyominoes having the same areas. Nevertheless, the bottom figure has an area ...
The 6.1.2 equation A^6=B^6+C^6 (1) is a special case of Fermat's last theorem with n=6, and so has no solution. No 6.1.n solutions are known for n<=6 (Lander et al. 1967; Guy ...
Discrete Mathematics
The Spieker center is the center Sp of the Spieker circle, i.e., the incenter of the medial triangle of a reference triangle DeltaABC. It is also the center of the excircles ...
A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...
The area of the shadow of a body on a plane, also called the "outer quermass."
Given five equal disks placed symmetrically about a given center, what is the smallest radius r for which the radius of the circular area covered by the five disks is 1? The ...
The assignment of labels or colors to the edges or vertices of a graph. The most common types of graph colorings are edge coloring and vertex coloring.
...