Abstract
A hamiltonian walk of a digraph is a closed spanning directed walk with minimum length in the digraph. The length of a hamiltonian walk in a digraph D is called the hamiltonian number of D, denoted by h(D). In Chang and Tong (J Comb Optim 25:694–701, 2013), Chang and Tong proved that for a strongly connected digraph D of order n, \(n\le h(D)\le \lfloor \frac{(n+1)^2}{4} \rfloor \), and characterized the strongly connected digraphs of order n with hamiltonian number \(\lfloor \frac{(n+1)^2}{4} \rfloor \). In the paper, we characterized the strongly connected digraphs of order n with hamiltonian number \(\lfloor \frac{(n+1)^2}{4} \rfloor -1\) and show that for any triple of integers n, k and t with \(n\ge 5\), \(n\ge k\ge 3\) and \(t\ge 0\), there is a class of nonisomorphic digraphs with order n and hamiltonian number \(n(n-k+1)-t\).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.