On the maximum number of connected induced subgraphs of a graph

Abstract

We characterise the structure of those graphs of a given order which maximise the number of connected induced subgraphs for seven different graph classes, each with other prescribed parameters like minimum degree, independence number, vertex cover number, vertex connectivity, edge connectivity, chromatic number, number of bridges, thereby contributing to filling a gap in the literature.

07 pages, 1 figure