Search Results for ""
181 - 190 of 492 for Spanning TreeSearch Results
The Wagner graph is a name sometimes given to the 4-Möbius ladder (Bondy and Murty 2008, pp. 275-276). The association arises through the theorem of Wagner (1937) that graphs ...
There are several definitions of "almost Hamiltonian" in use. As defined by Punnim et al. (2007), an almost Hamiltonian graph is a graph on n nodes having Hamiltonian number ...
An archaic name for topology.
A statistical distribution having two separated peaks.
An area-preserving affine transformation. Equiaffinities include the crossed hyperbolic rotation, elliptic rotation, hyperbolic rotation, and parabolic rotation.
Given a subspace A of a space X and a map from A to a space Y, is it possible to extend that map to a map from X to Y?
Johnson solid J_(24).
A property of a space which is also true of each of its subspaces. Being "first-countable" is hereditary, but having a given genus is not.
n sets of s trials each, with the probability of success p constant in each set. var(x/n)=spq+s(s-1)sigma_p^2, where sigma_p^2 is the variance of p_i.
(x^2+axy+by^2)(t^2+atu+bu^2)=r^2+ars+bs^2, (1) where r = xt-byu (2) s = yt+xu+ayu. (3)
...
View search results from all Wolfram sites (2800 matches)

