Papers
Topics
Authors
Recent
Search
2000 character limit reached

Wiener Index, Hyper-wiener Index, Harary Index and Hamiltonicity of graphs

Published 8 Apr 2018 in math.CO | (1804.02648v1)

Abstract: 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.

Authors (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.