Search Results for ""

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

A unit-distance embedding is a graph embedding in which all edges have unit length. A graph possessing a unit-distance embedding in two dimensions is called a unit-distance ...

A branch point whose neighborhood of values wrap around an infinite number of times as their complex arguments are varied. The point z=0 under the function lnz is therefore a ...

Let ABCD be a quadrilateral with perpendicular polygon diagonals. The midpoints of the sides (a, b, c, and d) determine a parallelogram (the Varignon parallelogram) with ...

A topological space X has a one-point compactification if and only if it is locally compact. To see a part of this, assume Y is compact, y in Y, X=Y\{y} and x in X. Let C be ...

Let A^' be the outermost vertex of the regular pentagon erected inwards on side BC of a reference triangle DeltaABC. Similarly, define B^' and C^'. The triangle ...

Let A^' be the outermost vertex of the regular pentagon erected outward on side BC of a reference triangle DeltaABC. Similarly, define B^' and C^'. The triangle ...

A uniform distribution of points on the circumference of a circle can be obtained by picking a random real number between 0 and 2pi. Picking random points on a circle is ...

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.

An elliptic fixed point of a differential equation is a fixed point for which the stability matrix has purely imaginary eigenvalues lambda_+/-=+/-iomega (for omega>0). An ...