Search Results for ""

A Haar graph H(n) is a bipartite regular indexed by a positive integer and obtained by a simple binary encoding of cyclically adjacent vertices. Haar graphs may be connected ...

There are several definitions of "almost Hamiltonian" in use. As defined by Punnim et al. (2007), an almost Hamiltonian graph is a graph on n nodes having Hamiltonian number ...

There are (at least) three different types of points known as Steiner points. The point S of concurrence of the three lines drawn through the vertices of a triangle parallel ...

A number taken to the power 3 is said to be cubed, so x^3 is called "x cubed." This terminology derives from the fact that the volume of a cube of edge length x is given by ...

A pivot point of a curve is a fixed point Q such that points P lying on the curve and their (isogonal, isotomic, etc.) conjugates are collinear with Q.

A general plane quartic curve is a curve of the form (1) Examples include the ampersand curve, bean curve, bicorn, bicuspid curve, bifoliate, bifolium, bitangent-rich curve, ...

Tutte (1971/72) conjectured that there are no 3-connected nonhamiltonian bicubic graphs. However, a counterexample was found by J. D. Horton in 1976 (Gropp 1990), and several ...

A planar hypohamiltonian graph is a hypohamiltonian graph that is also planar. A number of planar hypohamiltonian graphs are illustrated above. Chvátal (1973) first asked if ...

A polyhedral graph corresponding to the skeleton of a Platonic solid. The five platonic graphs, the tetrahedral graph, cubical graph, octahedral graph, dodecahedral graph, ...

The parameter r (sometimes also denoted mu) in the logistic equation x_(n+1)=rx_n(1-x_n).