The maximum Wiener index of a uniform hypergraph
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.