We prove that among all graphs of order n, the path uniquely minimises average its connected induced subgraphs. This confirms a conjecture Kroeker, Mol and Oellermann, generalises classical result Jamison for trees, as well giving new, shorter proof latter. While this paper was being prepared, different given by Andrew Vince.