Search Results for ""

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...

A proof which indirectly shows a mathematical object exists without providing a specific example or algorithm for producing an example. Nonconstructive proofs are also called ...

Consider the average volume of a tetrahedron picked at random inside an octahedron of unit volume. The answer is difficult to compute analytically (Zinani 2003), but the mean ...

Move a point Pi_0 along a line from an initial point to a final point. It traces out a line segment Pi_1. When Pi_1 is translated from an initial position to a final ...

A function is said to be piecewise constant if it is locally constant in connected regions separated by a possibly infinite number of lower-dimensional boundaries. The ...

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

A recurrence plot is defined as a plot of the quantity R(t,tau)=H(epsilon-||f(t)-f(tau)||), where H(x) is the Heaviside step function and ||f|| denotes a norm. A recurrence ...

A symbol of the form {p,q,r,...} used to describe regular polygons, polyhedra, and their higher-dimensional counterparts. The symbol {p} denotes a regular polygon for integer ...

The second Napoleon point N^', also called the inner Napoleon point, is the concurrence of lines drawn between polygon vertices of a given triangle DeltaABC and the opposite ...

An orientable surface with one boundary component such that the boundary component of the surface is a given knot K. In 1934, Seifert proved that such a surface can be ...