On the Maximum Number of Connected Induced Subgraphs of a Graph
Year: 2025
Type: article
Abstract: We characterize the structure of graphs of a given order that maximize the number of connected induced subgraphs across seven different graph classes, each with specific parameters such as minimum degree, independence number, vertex cover number, vertex connectivity, edge connectivity, chromatic number, and the number of bridges. This work contributes to filling a gap in the existing literature.
Source: Contemporary Mathematics
Author: Audace A.V. Dossou-Olory
Institution: Université d'Abomey-Calavi
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4408538915