Assume that n and k are positive integers with n ≥ 2k + 1. A non-hamiltonian graph G is hypo hamiltonian if G − v is hamiltonian for any v ∈ V (G). It is proved that the generalized Petersen graph P (n, k) is hypo hamiltonian if and only if k = 2 and n ≡ 5 (mod 6). Similarly, a hamiltonian graph G is hyper hamiltonian if G−v is hamiltonian for any v ∈ V (G). In this paper, we will give some nec...

We investigate here the hamiltonicity and traceability of a class of polytopes generalizing pyramids, prisms, and polytopes with Halin 1-skeleta.

Farhi et al. suggested the analogue quantum search Hamiltonian and Fenner also proposed the intuitive quantum search Hamiltonian. Recently the generalized quantum search Hamiltonian containning hamiltonians of Farhi et al. and Fenner was presented in quant-ph/0110020. In this letter, we analyze the running time of the generalized quantum search Hamiltonian. Our analysis displays two surprising ...

We have studied the self-adjointness of generalized MIC-Kepler Hamiltonian, obtained from the formally self-adjoint generalized MIC-Kepler Hamiltonian. We have shown that for l̃ = 0, the system admits an 1-parameter family of self-adjoint extension and for l̃ 6= 0 but l̃ < 1 2 , it has also an 1parameter family of self-adjoint extension.

On globally hyperbolic spacetimes, each foliation by spacelike hypersurfaces corresponds to a Hamiltonian description of field theory, and unitarity follows formally from the Hermiticity of the Hamiltonian. For a renormalizable theory, unitarity at each order in perturbation theory follows from the corresponding Hermiticity of each term in the time-ordered product of interaction Hamiltonians. F...