4 citations · 6 across the 11 of their papers we have counts for
14 papers
Ratio of the number of -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 of induced subgraphs with size of a graph was introduced recently as the number of -nearly independent vertex subsets of . Results highlighting si…
Nordhaus-Gaddum inequalities for the number of 1-nearly independent vertex subsets
Eric O. D. Andriantiana, Zekhaya B. Shozi
For a graph , a vertex subset is called \emph{-nearly independent} if the subgraph it induces contains exactly one edge. Let denote the number of such subsets in …
On the average size of -nearly independent vertex sets in graphs
Audace A. V. Dossou-Olory, Eric O. Andriantiana
A -nearly independent vertex subset of a graph is a set of vertices that induces a subgraph containing exactly edges. For , this coincides with the classical noti…
The number of 1-nearly independent edge subsets
Eric O. D. Andriantiana, Zekhaya B. Shozi
Let be a graph with set of vertices and set of edges . A subset of is called a -nearly independent edge subsets if there are exactly …
On the Sombor index of trees with degree restrictions
Eric O. D. Andriantiana, Valisoa R. M. Rakotonarivo
We study the Sombor index of trees with various degree restrictions. In addition to rediscovering that among all trees with a given degree sequence, the greedy tree minimises the S…
The number of -nearly independent vertex subsets
Eric Ould Dadah Andriantiana, Zekhaya B. Shozi
Let be a graph with vertex set and edge set . A subset of is an independent vertex subset if no two vertices in are adjacent in . We study the nu…
Extremal trees with fixed degree sequence
Eric O. D. Andriantiana, Valisoa Razanajatovo Misanantenaina, Stephan Wagner
The greedy tree and the -tree are known to be extremal among trees with degree sequence with respect to various graph invariants.…
Trees with minimum number of infima closed sets
Eric Ould Dadah Andriantiana, Stephan Wagner
Let be a rooted tree, and its set of vertices. A subset of is called an infima closed set of if for any two vertices , the first common ancestor…
Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs
Eric Ould Dadah Andriantiana, Audace Amen Vioutou Dossou-Olory
Let be the number of connected induced subgraphs in a graph , and the complement of . We prove that is minimum, among all -ver…
Subtrees and independent subsets in unicyclic graphs and unicyclic graphs with fixed segment sequence
Eric Ould Dadah Andriantiana, Hua Wang
In the study of topological indices two negative correlations are well known: that between the number of subtrees and the Wiener index (sum of distances), and that between the Merr…
The average size of matchings in graphs
Eric O. D. Andriantiana, Valisoa Razanajatovo Misanantenaina, Stephan Wagner
In this paper, we consider the average size of independent edge sets, also called matchings, in a graph. We characterize the extremal graphs for the average size of matchings in ge…
The ancestral matrix of a rooted tree
Eric O. D. Andriantiana, Kenneth Dadedzi, Stephan Wagner
Given a rooted tree with leaves , we define the ancestral matrix of to be the matrix for which the entry in the -th row, -th c…
The average size of independent sets of graphs
Eric O. D. Andriantiana, Valisoa Razanajatovo Misanantenaina, Stephan Wagner
In this paper, we study the average size of independent (vertex) sets of a graph. This invariant can be regarded as the logarithmic derivative of the independence polynomial evalua…
Spectral moments of trees with given degree sequence
Eric Ould Dadah Andriantiana, Stephan Wagner
Let be the eigenvalues of a graph . For any , the -th spectral moment of is defined by $\M_k(G)=λ_1^k+\dots+λ_n^k$. We use the fact that $\M_k(G)…