Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Mean Order of Connected Induced Subgraphs of Block Graphs

Published 13 Nov 2018 in math.CO | (1811.05430v1)

Abstract: The average order of the connected induced subgraphs of a graph $G$ is called the mean connected induced subgraph (CIS) order of $G$. This is an extension of the mean subtree order of a tree, first studied by Jamison. In this article, we demonstrate that among all connected block graphs of order $n$, the path $P_n$ has minimum mean CIS order. This extends a result of Jamison from trees to connected block graphs, and supports the conjecture of Kroeker, Mol, and Oellermann that $P_n$ has minimum mean CIS order among all connected graphs of order $n$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.