4 citations · 4 across the 2 of their papers we have counts for
7 papers
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.…
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…