Harary index and some Hamiltonian properties of graphs

For a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v), where dG(u,v) is the distance between vertices u and v. Hua and Wang (2013), using Harary index, obtained a sufficient condition for the traceable graphs. In this note, we use Harary index to present suffici...

Full description

Bibliographic Details
Main Author: Rao Li
Format: Article
Language:English
Published: Taylor & Francis Group 2015-07-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Online Access:http://www.sciencedirect.com/science/article/pii/S0972860015000110