The Wiener index of a connected k‐uniform hypergraph is defined as the summation of distances between all pairs of vertices. We determine the unique k‐uniform unicyclic hypergraphs with maximum and second maximum, minimum and second minimum Wiener indices, respectively.

中文翻译：

---

维纳指数上的k一致单圈超图的极值结构

连通的k一致超图的Wiener指数定义为所有顶点对之间距离的总和。我们分别用最大和第二个最大，最小和第二个最小的维纳指数确定唯一的k均匀单圈超图。