Search Results for ""

The snub dodecahedral graph is a quintic graph on 60 nodes and 150 edges that corresponds to the skeleton of the snub dodecahedron, great inverted snub icosidodecahedron, ...

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

A simple unlabeled graph whose connectivity is considered purely on the basis of topological equivalence, so that two edges (v_1,v_2) and (v_2,v_3) joined by a node v_2 of ...

A path in a graph G is a subgraph of G that is a path graph (West 2000, p. 20). The length of a path is the number of edges it contains. In most contexts, a path must contain ...

Abel's integral is the definite integral I = int_0^infty(tdt)/((e^(pit)-e^(-pit))(t^2+1)) (1) = 1/2int_(-infty)^infty(tdt)/((e^(pit)-e^(-pit))(t^2+1)) (2) = ...

The integral int_0^1x^p(1-x)^qdx, called the Eulerian integral of the first kind by Legendre and Whittaker and Watson (1990). The solution is the beta function B(p+1,q+1).

The Robertson-Wegner graph is of the four (5,5)-cage graphs, also called Robertson's cage (Read and Wilson 1998, p. 273). Like the other (5,5)-cages, the Robertson-Wegner ...

A definite integral is an integral int_a^bf(x)dx (1) with upper and lower limits. If x is restricted to lie on the real line, the definite integral is known as a Riemann ...

Consider a set of points X_i on an attractor, then the correlation integral is C(l)=lim_(N->infty)1/(N^2)f, where f is the number of pairs (i,j) whose distance |X_i-X_j|<l. ...

Dawson's integral (Abramowitz and Stegun 1972, pp. 295 and 319), also sometimes called Dawson's function, is the entire function given by the integral F(x) = ...