Audace A. V. Dossou-Olory

activity

20182026

most citedFurther results on the inducibility of

d

-ary trees

5 citations · 23 across the 19 of their papers we have counts for

collaborators

21 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 $σ_{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 si…

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…

math.CO2024

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.CO2023

Decks of rooted binary trees

Ann Clifton, Eva Czabarka, Audace Dossou-Olory +5

We consider extremal problems related to decks and multidecks of rooted binary trees (a.k.a. rooted phylogenetic tree shapes). Here, the deck (resp. multideck) of a tree $T$ refers…

math.CO2023

The level matrix of a tree and its spectrum

Audace A. V. Dossou-Olory

Given a rooted tree $T$ with vertices $u_{1}, u_{2}, \dots, u_{n}$ , the level matrix $L (T)$ of $T$ is the $n \times n$ matrix for which the $(i, j)$ -th entry is the absolute difference of t…

math.CO2023★ 1 cited

On the maximum number of connected induced subgraphs of a graph

Audace A. V. Dossou-Olory

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 prescribe…

math.CO2022★ 1 cited

On isomorphism classes of leaf-induced subtrees in topological trees

Audace A. V. Dossou-Olory, Ignatius Boadi

A subtree can be induced in a natural way by a subset of leaves of a rooted tree. We study the number of nonisomorphic such subtrees induced by leaves (leaf-induced subtrees) of a…

math.CO2020

Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs

Eric Ould Dadah Andriantiana, Audace Amen Vioutou Dossou-Olory

Let $η (G)$ be the number of connected induced subgraphs in a graph $G$ , and $G$ the complement of $G$ . We prove that $η (G) + η (G)$ is minimum, among all $n$ -ver…

math.CO2020

Bounding the $k$ -Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence

Peter Dankelmann, Audace A. V. Dossou-Olory

The eccentric sequence of a connected graph $G$ is the nondecreasing sequence of the eccentricities of its vertices. The Wiener index of $G$ is the sum of the distances between all…

math.CO2020★ 3 cited

Wiener index, number of subtrees, and tree eccentric sequence

Peter Dankelmann, Audace A. V. Dossou-Olory

The eccentricity of a vertex $u$ in a connected graph $G$ is the distance between $u$ and a vertex farthest from it; the eccentric sequence of $G$ is the nondecreasing sequence of…

math.CO2020★ 1 cited

Cut vertex and unicyclic graphs with the maximum number of connected induced subgraphs

Audace A. V. Dossou-Olory

Cut vertices are often used as a measure of nodes' importance within a network. They are those nodes whose failure disconnects a graph. Let N(G) be the number of connected induced…

math.CO2019

Cut and pendant vertices and the number of connected induced subgraphs of a graph

Audace A. V. Dossou-Olory

A vertex whose removal in a graph $G$ increases the number of components of $G$ is called a cut vertex. For all $n, c$ , we determine the maximum number of connected induced subgraph…

math.CO2018★ 4 cited

Graphs and unicyclic graphs with extremal number of connected induced subgraphs

Audace A. V. Dossou-Olory

Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes,…

math.CO2018★ 2 cited

Leaf-induced subtrees of leaf-Fibonacci trees

Audace Amen Vioutou Dossou-Olory

In analogy to a concept of Fibonacci trees, we define the leaf-Fibonacci tree of size $n$ and investigate its number of nonisomorphic leaf-induced subtrees. Denote by $f_{0}$ the one…

math.CO2018★ 3 cited

On the inducibility of small trees

Audace A. V. Dossou-Olory, Stephan Wagner

The quantity that captures the asymptotic value of the maximum number of appearances of a given topological tree (a rooted tree with no vertices of outdegree $1$ ) $S$ with $k$ leav…

math.CO2018★ 5 cited

Further results on the inducibility of $d$ -ary trees

Audace A. V. Dossou-Olory, Stephan Wagner

A subset of leaves of a rooted tree induces a new tree in a natural way. The density of a tree $D$ inside a larger tree $T$ is the proportion of such leaf-induced subtrees in $T$ t…

math.CO2018

The topological trees with extreme Matula numbers

Audace Amen Vioutou Dossou-Olory

Denote by $p_{m}$ the $m$ -th prime number ( $p_{1} = 2, p_{2} = 3, p_{3} = 5, p_{4} = 7, \dots$ ). Let $T$ be a rooted tree with branches $T_{1}, T_{2}, \dots, T_{r}$ . The Matula number $M (T)$ of $T$ is $p_…

math.CO2018

The minimum asymptotic density of binary caterpillars

Audace A. V. Dossou-Olory

Given $d \geq 2$ and two rooted $d$ -ary trees $D$ and $T$ such that $D$ has $k$ leaves, the density $γ (D, T)$ of $D$ in $T$ is the proportion of all $k$ -element subsets of leaves of…

math.CO2018

Inducibility of Topological Trees

Audace Amen Vioutou Dossou-Olory, Stephan Wagner

Trees without vertices of degree $2$ are sometimes named topological trees. In this work, we bring forward the study of the inducibility of (rooted) topological trees with a given…

math.CO2018★ 3 cited

Inducibility of d-ary trees

Éva Czabarka, Audace A. V. Dossou-Olory, László A. Székely +1

Imitating a recently introduced invariant of trees, we initiate the study of the inducibility of $d$ -ary trees (rooted trees whose vertex outdegrees are bounded from above by $d\ge…

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

Bicyclic graphs with the smallest and largest numbers of connected sets

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

Characterization of Trees with Maximum Security

Decks of rooted binary trees

The level matrix of a tree and its spectrum

On the maximum number of connected induced subgraphs of a graph

On isomorphism classes of leaf-induced subtrees in topological trees

Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs

Bounding the k-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence

Wiener index, number of subtrees, and tree eccentric sequence

Cut vertex and unicyclic graphs with the maximum number of connected induced subgraphs

Cut and pendant vertices and the number of connected induced subgraphs of a graph

Graphs and unicyclic graphs with extremal number of connected induced subgraphs

Leaf-induced subtrees of leaf-Fibonacci trees

On the inducibility of small trees

Further results on the inducibility of d-ary trees

The topological trees with extreme Matula numbers

The minimum asymptotic density of binary caterpillars

Inducibility of Topological Trees

Inducibility of d-ary trees

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

Bounding the $k$ -Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence

Further results on the inducibility of $d$ -ary trees