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...
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 |
Similar Items
-
Harary index of bipartite graphs
by: Hanyuan Deng, et al.
Published: (2019-10-01) -
On the Weiner and Harary Index of Splitting Graphs
by: Antalan, J.R.M, et al.
Published: (2022) -
Maximum Detour–Harary Index for Some Graph Classes
by: Wei Fang, et al.
Published: (2018-11-01) -
Harary Index of Product Graphs
by: Pattabiraman K., et al.
Published: (2015-02-01) -
On the Additively Weighted Harary Index of Some Composite Graphs
by: Behrooz Khosravi, et al.
Published: (2017-03-01)