Search Results for ""

A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...

Tietze's graph is the cubic graph on 12 nodes and 18 edges illustrated above in a number of embeddings. It is implemented in the Wolfram Language as GraphData["TietzeGraph"]. ...

The numbers lambda_(nun) in the Gaussian quadrature formula Q_n(f)=sum_(nu=1)^nlambda_(nun)f(x_(nun)).

The abscissas of the N-point Gaussian quadrature formula are precisely the roots of the orthogonal polynomial for the same interval and weighting function.

Let a closed surface have genus g. Then the polyhedral formula generalizes to the Poincaré formula chi(g)=V-E+F, (1) where chi(g)=2-2g (2) is the Euler characteristic, ...

The semiperimeter on a figure is defined as s=1/2p, (1) where p is the perimeter. The semiperimeter of polygons appears in unexpected ways in the computation of their areas. ...

There are nine possible types of isolated singularities on a cubic surface, eight of them rational double points. Each type of isolated singularity has an associated normal ...

Cubic lattice sums include the following: b_2(2s) = sum^'_(i,j=-infty)^infty((-1)^(i+j))/((i^2+j^2)^s) (1) b_3(2s) = ...

A well-formed formula B is said to be true for the interpretation M (written |=_MB) iff every sequence in Sigma (the set of all denumerable sequences of elements of the ...

The Gray graph is a cubic semisymmetric graph on 54 vertices. It was discovered by Marion C. Gray in 1932, and was first published by Bouwer (1968). Malnič et al. (2002) ...