EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Distance Sequences to Bound the Harary Index and Other Wiener-Type Indices of a Graph

Peter Dankelmann

match Communications in Mathematical and in Computer Chemistry · 10.03.2026 · 2 (96) · 731

DOI: 10.46793/match.96-2.16725 ↗

Kurz gefasst

Fachartikel in der Zeitschrift match Communications in Mathematical and in Computer Chemistry, online erschienen am 10.03.2026. Verfasst von Peter Dankelmann. Die Arbeit nennt 52 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper we obtain 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 and the multiplicative Wiener index for (i) graphs of given order and size (which solves a problem in the monograph [Xu, Das, Trinajsti´c, The Harary index of a graph, Springer (2015)]), (ii) κ-connected graphs, where κ is even, (iii) maximal outerplanar graphs, (iv) Apollonian networks, and (v) for trees in which all vertices have odd degree. We use a novel approach to prove our bounds for a very general class of distance-based topological indices of graphs, which includes the Wiener index and most of its generalizations, including the Harary index, the hyper-Wiener index and the multiplicative Wiener index.

Zitieren

APA

Dankelmann, P. (2026). Distance Sequences to Bound the Harary Index and Other Wiener-Type Indices of a Graph. match Communications in Mathematical and in Computer Chemistry, 2(96), 731. https://doi.org/10.46793/match.96-2.16725

Vancouver

Dankelmann P. Distance Sequences to Bound the Harary Index and Other Wiener-Type Indices of a Graph. match Communications in Mathematical and in Computer Chemistry. 2026;2(96):731. doi:10.46793/match.96-2.16725

BibTeX
@article{Dankelmann2026,
  author = {Dankelmann, Peter},
  title = {Distance Sequences to Bound the Harary Index and Other Wiener-Type Indices of a Graph},
  journal = {match Communications in Mathematical and in Computer Chemistry},
  year = {2026},
  volume = {2},
  number = {96},
  pages = {731},
  doi = {10.46793/match.96-2.16725}
}
Kostenlos starten →