Search Results for ""

The plane through the midpoint of a line segment and perpendicular to that segment, also called a mediating plane. The term "mediator" was introduced by J. Neuberg ...

The diameter of a polygon is the largest distance between any pair of vertices. In other words, it is the length of the longest polygon diagonal (e.g., straight line segment ...

A transformation characterized by an invariant line and a scale factor (one-way stretch) or two invariant lines and corresponding scale factors (two-way stretch).

A polygon can be defined (as illustrated above) as a geometric object "consisting of a number of points (called vertices) and an equal number of line segments (called sides), ...

The Fibonacci cube graph of order n is a graph on F_(n+2) vertices, where F_n is a Fibonacci number, labeled by the Zeckendorf representations of the numbers 0 to F_(n+2)-1 ...

A directed graph is called an arborescence if, from a given node x known as the root vertex, there is exactly one elementary path from x to every other node y.

A weighted graph in which the weights are equal to the Euclidean lengths of the edges in a specified embedding (Skiena 1990, pp. 201 and 252).

Tait's Hamiltonian graph conjecture asserted that every cubic polyhedral graph is Hamiltonian. It was proposed by Tait in 1880 and refuted by Tutte (1946) with a ...

A graph G is transitive if any three vertices (x,y,z) such that edges (x,y),(y,z) in G imply (x,z) in G. Unlabeled transitive digraphs are called digraph topologies.

A maximal clique is a clique that cannot be extended by including one more adjacent vertex, meaning it is not a subset of a larger clique. A maximum clique (i.e., clique of ...