Five results on maximizing topological indices in graphs

In this paper, we prove a collection of results on graphical indices. We determine the extremal graphs attaining the maximal generalized Wiener index (e.g. the hyper-Wiener index) among all graphs with given matching number or independence number. This generalizes some work of Dankelmann, as well as...

Full description

Bibliographic Details
Main Author: Stijn Cambie
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2021-11-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
Online Access:https://dmtcs.episciences.org/6896/pdf