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

A non-Abelian group all of whose subgroups are self-conjugate.

A linear combination of basis quaternions with integer coefficients.

Consider a one-dimensional Hamiltonian map of the form H(p,q)=1/2p^2+V(q), (1) which satisfies Hamilton's equations q^. = (partialH)/(partialp) (2) p^. = ...

A (2n)×(2n) complex matrix A in C^(2n×2n) is said to be Hamiltonian if J_nA=(J_nA)^(H), (1) where J_n in R^(2n×2n) is the matrix of the form J_n=[0 I_n; I_n 0], (2) I_n is ...

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 Hamiltonian path, also called a Hamilton path, is a graph path between two vertices of a graph that visits each vertex exactly once. If a Hamiltonian path exists whose ...

A system of variables which can be written in the form of Hamilton's equations.

A Hamiltonian walk on a connected graph is a closed walk of minimal length which visits every vertex of a graph (and may visit vertices and edges multiple times). For ...

The equations defined by q^. = (partialH)/(partialp) (1) p^. = -(partialH)/(partialq), (2) where p^.=dp/dt and q^.=dq/dt is fluxion notation and H is the so-called ...