The maximum Wiener index of a uniform hypergraph

IF 0.7 3区数学 Q2 MATHEMATICS

Discrete Mathematics Pub Date : 2025-09-23 DOI:10.1016/j.disc.2025.114797

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

引用次数: 0

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 all hypergraphs attaining the maximum Wiener index for every n and k.

查看原文本刊更多论文

一致超图的最大Wiener索引

（超）图的维纳指数是通过对所有顶点对之间的距离求和来计算的。我们确定了连通n顶点k-均匀超图的最大可能Wiener指标，并对每n和k达到最大Wiener指标的所有超图进行了刻画。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Mathematics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

424

审稿时长

6 months

期刊介绍： Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.