Mathematics > Combinatorics
[Submitted on 20 Nov 2024]
Title:Distance Sequences to bound the Harary Index and other Wiener-type Indices of a Graph
View PDF HTML (experimental)Abstract:In this paper we obtain bounds on a very general class of distance-based topological indices of graphs, which includes the Wiener index, defined as the sum of the distances between all pairs of vertices of the graph, and most generalisations of the Wiener index, including the Harary index and the hyper-Wiener index.
Our results imply several new bounds on well-studied topological indices, among those sharp lower bounds on the Harary index and sharp upper bounds on the hyper-Wiener index for (i) graphs of given order and size (which resolves a problem in the monograph [The Harary index of a graph, Xu, Das, Trinajstić, Springer (2015)], (ii) for $\kappa$-connected graphs, where $\kappa$ is even, (iii) for maximal outerplanar graphs and for Apollonian networks (a subclass of maximal planar graphs), and (iv) for trees in which all vertices have odd degree.
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.