论文信息 - 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

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 Pn. In 2018, Kroeker, Mol, and Oellermann conjectured that Pn minimizes the average order over all connected graphs. The main result of this paper confirms this conjecture.

Andrew Vince

[1] Ortrud R. Oellermann,et al. Maximizing the mean subtree order , 2019, J. Graph Theory.

[2] Ortrud R. Oellermann,et al. The mean order of sub‐k‐trees of k‐trees , 2018, J. Graph Theory.

[3] Scott Makeig,et al. Enumeration of BC-subtrees of trees , 2006 .

[4] Ortrud R. Oellermann,et al. On the mean connected induced subgraph order of cographs , 2018, Australas. J Comb..

[5] John Haslegrave,et al. Extremal results on average subtree density of series-reduced trees , 2013, J. Comb. Theory, Ser. B.

[6] Hua Wang,et al. On the Local and Global Means of Subtree Orders , 2016, J. Graph Theory.

[7] Robert E. Jamison,et al. Monotonicity of the mean order of subtrees , 1984, J. Comb. Theory, Ser. B.

[8] Hua Wang,et al. The average order of a subtree of a tree , 2010, J. Comb. Theory, Ser. B.

[9] Lou Caccetta,et al. Graphs of maximum diameter , 1992, Discret. Math..

[10] Robert E. Jamison,et al. On the average number of nodes in a subtree of a tree , 1983, J. Comb. Theory, Ser. B.

[11] ANDREW VINCE. The average size of a connected vertex set of a graph - Explicit formulas and open problems , 2021, J. Graph Theory.