The path minimises the average size of a connected induced subgraph
<p>We prove that among connected graphs of order n, the path uniquely minimises the average order of its connected induced subgraphs. This confirms a conjecture of Kroeker, Mol and Oellermann, and generalises a classical result of Jamison for trees, as well as giving a new, shorter proof of th...
| Үндсэн зохиолч: | |
|---|---|
| Формат: | Journal article |
| Хэл сонгох: | English |
| Хэвлэсэн: |
Elsevier
2022
|