No abstract

We get a formula for the number of hamiltonian circuits of a graph through which we characterize the special hamiltonian graphs, that is containing a dominant circuit of minimal length. (2000): 05C45. Mathematics Subject Classification

No abstract

No abstract

We prove some necessary and easily verifiable conditions for a graph to be Hamiltonian, in terms of easily constructible matrices. The interest of this research derives from the non-existence till now of so friendly conditions. (2000): 05C45. Mathematics Subject Classification