arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.15174math.CO
收藏

图的连通顶点集平均大小的下界

A Lower Bound on the Average Size of a Connected Vertex Set of a Graph

Andrew Vince

摘要:

本文研究图的连通诱导子图的平均阶。这推广到一般的图,一棵树的子树的平均阶。在1984年,Jamison证明了在所有$n$阶的树上,路径$P_n$使平均阶最小化。在2018年,Kroeker,Mol和Oellermann证明了$P_n$可以最小化所有连通图的平均阶数。本文的主要结果证实了这一猜想。

英文摘要:

The topic is the average order of a connected induced subgraph of a graph. This generalizes, to graphs in general, the average order of a subtree of a tree. In 1984, Jamison proved that the average order, over all trees of order $n$, is minimized by the path $P_n$. In 2018, Kroeker, Mol, and Oellermann conjectured that $P_n$ minimizes the average order over all connected graphs. The main result of this paper confirms this conjecture.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑