The maximum Wiener index of a uniform hypergraph
Combinatorics
2023-02-20 v1
Abstract
The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected -vertex -uniform hypergraph and characterize for every~ all hypergraphs attaining the maximum Wiener index.
Keywords
Cite
@article{arxiv.2302.08686,
title = {The maximum Wiener index of a uniform hypergraph},
author = {Stijn Cambie and Ervin Győri and Nika Salia and Casey Tompkins and James Tuite},
journal= {arXiv preprint arXiv:2302.08686},
year = {2023}
}