2018/04/08 by Guidong Yu, Yu, Guidong, Lifang Ren +3
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.1804.02648
openalex publication_date 2018/04/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we discuss the Hamiltonicity of graphs in terms of Wiener index, hyper-Wiener index and Harary index of their quasi-complement or complement. Firstly, we give some sufficient conditions for an balanced bipartite graph with given the minimum degree to be traceable and Hamiltonian, respectively. Secondly, we present some sufficient conditions for a nearly balanced bipartite graph with given the minimum degree to be traceable. Thirdly, we establish some conditions for a graph with given the minimum degree to be traceable and Hamiltonian, respectively. Finally, we provide some conditions for a k-connected graph to be Hamilton-connected and traceable for every vertex, respectively.