TOPICS
Search

Search Results for ""


631 - 640 of 652 for Newton algorithmSearch Results
The skeleton of the tesseract, commonly denoted Q_4, is a quartic symmetric graph with girth 4 and diameter 4. The automorphism group of the tesseract is of order 2^7·3=384 ...
Every planar graph (i.e., graph with graph genus 0) has an embedding on a torus. In contrast, toroidal graphs are embeddable on the torus, but not in the plane, i.e., they ...
The tower of Hanoi (commonly also known as the "towers of Hanoi"), is a puzzle invented by E. Lucas in 1883. It is also known as the Tower of Brahma puzzle and appeared as an ...
A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...
Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...
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 ...
The j-function is the modular function defined by j(tau)=1728J(tau), (1) where tau is the half-period ratio, I[tau]>0, ...
A prime number (or prime integer, often simply called a "prime" for short) is a positive integer p>1 that has no positive integer divisors other than 1 and p itself. More ...
Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. Apéry (1979) proved that zeta(3) is irrational, although ...
1 ... 61|62|63|64|65|66 Previous Next

...