Harary index and some Hamiltonian properties of graphs (Q896102)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Harary index and some Hamiltonian properties of graphs |
scientific article; zbMATH DE number 6520418
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Harary index and some Hamiltonian properties of graphs |
scientific article; zbMATH DE number 6520418 |
Statements
Harary index and some Hamiltonian properties of graphs (English)
0 references
11 December 2015
0 references
Let \(G\) be a connected graph. Then the Harary index of \(G\) is defined as \(H(G)=\sum_{u,v\in V(G)}\frac{1}{d_{G}(u,v)},\) where \(d_{v}(u,v)\) is the distance of \(u\), \(v\) in \(G\). In the paper, a sufficient condition for a connected graph to be Hamiltonian (Hamiltonian-connected) is given in terms of the Harary index.
0 references
Harary index
0 references
Hamiltonian graph
0 references
Hamilton-connected graph
0 references
0.954903244972229
0 references
0.8628624677658081
0 references
0.8512709736824036
0 references
0.8491719961166382
0 references
0.8489312529563904
0 references
