Audace A. V. Dossou-Olory

collaborators

4 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

Characterization of Trees with Maximum Security

Alex S. A. Alochukwu, Audace A. V. Dossou-Olory, Fadekemi J. Osaye +5

The rank (also known as protection number or leaf-height) of a vertex in a rooted tree is the minimum distance between the vertex and any of its leaf descendants. We consider the s…

math.CO2026

Bicyclic graphs with the smallest and largest numbers of connected sets

Audace A. V. Dossou-Olory

For a graph $G$ with vertex set $V$ , let N( $G$ ) denote the number of nonempty subsets of $V$ that induce a connected graph in $G$ . In this paper, we focus on determining N( $G$ ) for…

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

Characterization of Trees with Maximum Security

Bicyclic graphs with the smallest and largest numbers of connected sets

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