Search Results for ""

A Hamiltonian graph, also called a Hamilton graph, is a graph possessing a Hamiltonian cycle. A graph that is not Hamiltonian is said to be nonhamiltonian. A Hamiltonian ...

The Harries-Wong graph is one of the three (3,10)-cage graphs, the other two being the (10,3)-cage known as the Balaban 10-cage and the Harries graph. The Harries-Wong graph ...

The Harries graph is one of the three (3,10)-cage graphs, the other two being the (10,3)-cage known as the Balaban 10-cage and the Harries-Wong graph. The Harries graph is ...

The isogonal conjugate X^(-1) of a point X in the plane of the triangle DeltaABC is constructed by reflecting the lines AX, BX, and CX about the angle bisectors at A, B, and ...

The second knot polynomial discovered. Unlike the first-discovered Alexander polynomial, the Jones polynomial can sometimes distinguish handedness (as can its more powerful ...

The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture. Given two positive integers n and k, the Kneser graph K(n,k), often denoted ...

The points of intersection of the adjacent angle trisectors of the angles of any triangle DeltaABC are the polygon vertices of an equilateral triangle DeltaDEF known as the ...

An ordinary double point of a plane curve is point where a curve intersects itself such that two branches of the curve have distinct tangent lines. Ordinary double points of ...

Given a triangle DeltaABC, the triangle DeltaH_AH_BH_C whose vertices are endpoints of the altitudes from each of the vertices of DeltaABC is called the orthic triangle, or ...

Percolation, the fundamental notion at the heart of percolation theory, is a difficult idea to define precisely though it is quite easy to describe qualitatively. From the ...