On the average size of $1$-nearly independent vertex sets in graphs

Audace A. V. Dossou-Olory, Eric O. Andriantiana

A $k$-nearly independent vertex subset of a graph $G$ is a set of vertices that induces a subgraph containing exactly $k$ edges. For $k=0$, this coincides with the classical noti…