首页|A lower bound on the average size of a connected vertex set of a graph
A lower bound on the average size of a connected vertex set of a graph
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
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 1983, Jamison proved that the average order of a subtree, 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 of a connected induced subgraph over all connected graphs. The main result of this paper confirms this conjecture. (C) 2021 Elsevier Inc. All rights reserved.
NSTL
Elsevier
