Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8941815 | Discrete Applied Mathematics | 2018 | 6 Pages |
Abstract
In this paper, we give some sufficient conditions for connected graphs with given minimum degree to be Hamilton-connected and traceable from every vertex in terms of Wiener index and Harary index. We also prove sufficient conditions on Harary index of G¯ for G to be Hamilton-connected and traceable from every vertex with given minimum degree.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Qiannan Zhou, Ligong Wang, Yong Lu,