Bounds on hyper-Wiener index of graphs
From MaRDI portal
Publication:5370763
DOI10.1142/S1793557117500577zbMath1372.05055OpenAlexW2537254688MaRDI QIDQ5370763
Maryam Baghipur, Sadegh Rahimi, Abdollah Alhevaz
Publication date: 20 October 2017
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793557117500577
Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cites Work
- Wiener index of hexagonal systems
- Relationship between the Hosoya polynomial and the hyper-Wiener index
- A theorem on Wiener-type invariants for isometric subgraphs of hypercubes
- Improved bounds on the difference between the Szeged index and the Wiener index of graphs
- Comparison between the Wiener index and the Zagreb indices and the eccentric connectivity index for trees
- On structure-sensitivity of degree-based topological indices
- An algorithm for the calculation of the hyper-Wiener index of benzenoid hydrocarbons
- Graph connectivity and Wiener index
- Wiener index of trees: Theory and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounds on hyper-Wiener index of graphs