Harary index, binding number and toughness of graphs
Given a connected (molecular) graph , its Harary index ( ) is defined by the reciprocal sum of the distances between all unordered pairs of vertices of . Lower bounds on the graph vulnerability parameters binding number and toughness have been often used to determine that the graph has a certain...
Saved in:
| Main Author: | |
|---|---|
| Format: | Artigo |
| Language: | Inglês |
| Published: |
Elsevier
2024-04-01
|
| Series: | Kuwait Journal of Science |
| Subjects: | |
| Online Access: | https://www.sciencedirect.com/science/article/pii/S2307410824000014 |
| Tags: |
No Tags, Be the first to tag this record!
|