Search Results for ""

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...

The involute of the circle was first studied by Huygens when he was considering clocks without pendula for use on ships at sea. He used the circle involute in his first ...

A connection game is a board game in which players compete to develop or complete a type of topological connection with their pieces. This could involve forming a path ...

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 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, ...

A tree decomposition is a mapping of a graph into a related tree with desirable properties that allow it to be used to efficiently compute certain properties (e.g., ...

A topological sort is a permutation p of the vertices of a graph such that an edge {i,j} implies that i appears before j in p (Skiena 1990, p. 208). Only acyclic digraphs can ...

In a graph G, contraction of an edge e with endpoints u,v is the replacement of u and v with a single vertex such that edges incident to the new vertex are the edges other ...

A planar embedding, also called a "plane graph" (Harary 1994, p. 103; Harborth and Möller 1994), "planar drawing," or "plane drawing," of a planar graph is an embedding in ...