Search Results for ""

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

In general, the external similitude center of two circles C_1=C(x_1,r_1) and C_2=C(x_2,r_2) with centers given in Cartesian coordinates is given by ...

Fermat's last theorem is a theorem first proposed by Fermat in the form of a note scribbled in the margin of his copy of the ancient Greek text Arithmetica by Diophantus. The ...

The objective of global optimization is to find the globally best solution of (possibly nonlinear) models, in the (possible or known) presence of multiple local optima. ...

Replacing the logistic equation (dx)/(dt)=rx(1-x) (1) with the quadratic recurrence equation x_(n+1)=rx_n(1-x_n), (2) where r (sometimes also denoted mu) is a positive ...

A Mersenne prime is a Mersenne number, i.e., a number of the form M_n=2^n-1, that is prime. In order for M_n to be prime, n must itself be prime. This is true since for ...

The line joining the three collinear points of intersection of the extensions of corresponding sides in perspective triangles, also called the perspective axis or homology ...

The Petersen graph is the cubic graph on 10 vertices and 15 edges which is the unique (3,5)-cage graph (Harary 1994, p. 175), as well as the unique (3,5)-Moore graph. It can ...

If an n-sided Poncelet transverse constructed for two given conic sections is closed for one point of origin, it is closed for any position of the point of origin. ...

First published in Riemann's groundbreaking 1859 paper (Riemann 1859), the Riemann hypothesis is a deep mathematical conjecture which states that the nontrivial Riemann zeta ...