Search Results for ""

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 knot property, also called the twist number, defined as the sum of crossings p of a link L, w(L)=sum_(p in C(L))epsilon(p), (1) where epsilon(p) defined to be +/-1 if the ...

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

A ring is commutative if the multiplication operation is commutative.

x^(2n)+1=[x^2-2xcos(pi/(2n))+1] ×[x^2-2xcos((3pi)/(2n))+1]×...× ×[x^2-2xcos(((2n-1)pi)/(2n))+1].

The exists quantifier exists .

The Hamiltonian number h(n) of a connected graph G is the length of a Hamiltonian walk G. In other words, it is the minimum length of a closed spanning walk in the graph. For ...

A function used to study ordinary differential equations.