Search Results for ""

A path in the complex plane over which contour integration is performed to compute a contour integral. When choosing a contour to evaluate an integral on the real line, a ...

A differential of the form df=P(x,y)dx+Q(x,y)dy (1) is exact (also called a total differential) if intdf is path-independent. This will be true if ...

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...

A planted plane tree (V,E,v,alpha) is defined as a vertex set V, edges set E, root v, and order relation alpha on V which satisfies 1. For x,y in V if rho(x)<rho(y), then ...

A quasi-regular graph is a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 (Bozóki et al. 2020). ...

The Riemann-Siegel integral formula is the following representation of the xi-function xi(s) found in Riemann's Nachlass by Bessel-Hagen in 1926 (Siegel 1932; Edwards 2001, ...

Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...

A curtate cycloid, sometimes also called a contracted cycloid, is the path traced out by a fixed point at a radius b<a, where a is the radius of a rolling circle. Curtate ...

An Archimedean spiral with polar equation r=a/theta. (1) The hyperbolic spiral, also called the inverse spiral (Whittaker 1944, p. 83), originated with Pierre Varignon in ...

Let G be a simple graph with nonsingular (0,1) adjacency matrix A. If all the diagonal entries of the matrix inverse A^(-1) are zero and all the off-diagonal entries of ...