Abstract: | The Wiener-type invariants of a simple connected graph G = (V, E) can be expressed in terms of the quantities \(W_{f}=\sum_{\{u,v\}\subseteq V}f(d_{G}(u,v))\) for various choices of the function f(x), where dG(u,v) is the distance between vertices u and v in G. In this paper, we give some sufficient conditions for a connected graph to be Hamiltonian, a connected graph to be traceable, and a connected bipartite graph to be Hamiltonian in terms of the Wiener-type invariants. |