The maximum Wiener index of a uniform hypergraph

MaRDI QIDQ6426748zbMATH OpenFDO

Authors Stijn Cambie, Ervin Győri, Nika Salia, Casey Tompkins, James Tuite

Publication date 16 February 2023

Has companion code repository https://github.com/stijncambie/wienerhypergraph

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Distance in graphs (05C12) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

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 $n$-vertex $k$-uniform hypergraph and characterize for every~$n$ all hypergraphs attaining the maximum Wiener index.

This page was built for publication: The maximum Wiener index of a uniform hypergraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6426748)