TOPICS
Search

Search Results for ""


721 - 730 of 1453 for Distance FormulaSearch Results
The utility problem posits three houses and three utility companies--say, gas, electric, and water--and asks if each utility can be connected to each house without having any ...
The Wiener index W, denoted w (Wiener 1947) and also known as the "path number" or Wiener number (Plavšić et al. 1993), is a graph index defined for a graph on n nodes by ...
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 ...
Geometry
The Dirichlet eta function is the function eta(s) defined by eta(s) = sum_(k=1)^(infty)((-1)^(k-1))/(k^s) (1) = (1-2^(1-s))zeta(s), (2) where zeta(s) is the Riemann zeta ...
Let omega_1 and omega_2 be periods of a doubly periodic function, with tau=omega_2/omega_1 the half-period ratio a number with I[tau]!=0. Then Klein's absolute invariant ...
Stirling's approximation gives an approximate value for the factorial function n! or the gamma function Gamma(n) for n>>1. The approximation can most simply be derived for n ...
Dürer's solid, also known as the truncated triangular trapezohedron, is the 8-faced solid depicted in an engraving entitled Melencolia I by Albrecht Dürer (The British ...
The Errera graph is the 17-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...
The flower snarks, denoted J_n for n=5, 7, 9, ..., are a family of graphs discovered by Isaacs (1975) which are snarks. The construction for flower snarks may be generalized ...
1 ... 70|71|72|73|74|75|76 ... 146 Previous Next

...