E. Andriantiana

collaborators

3 papers

math.CO2026

Ratio of the number of $1$ -nearly independent vertex subsets and the Merrifield-Simmons index

Audace A. V. Dossou-Olory, Eric O. D. Andriantiana, Valisoa R. M. Rakotonarivo +1

The number $I ¨ _{k} (G)$ of induced subgraphs with size $k$ of a graph $G$ was introduced recently as the number of $k$ -nearly independent vertex subsets of $G$ . Results highlighting s…

math.CO2026

Nordhaus-Gaddum inequalities for the number of 1-nearly independent vertex subsets

Eric O. D. Andriantiana, Zekhaya B. Shozi

For a graph $G$ , a vertex subset is called \emph{ $1$ -nearly independent} if the subgraph it induces contains exactly one edge. Let $I ¨ _{1} (G)$ denote the number of such subsets in $G…

math.CO2025

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…

Ratio of the number of 1-nearly independent vertex subsets and the Merrifield-Simmons index

Nordhaus-Gaddum inequalities for the number of 1-nearly independent vertex subsets

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

Ratio of the number of $1$ -nearly independent vertex subsets and the Merrifield-Simmons index

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