3 citations · 4 across the 4 of their papers we have counts for
12 papers
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…
Bounding the -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 is the nondecreasing sequence of the eccentricities of its vertices. The Wiener index of is the sum of the distances between all…
Wiener index, number of subtrees, and tree eccentric sequence
Peter Dankelmann, Audace A. V. Dossou-Olory
The eccentricity of a vertex in a connected graph is the distance between and a vertex farthest from it; the eccentric sequence of is the nondecreasing sequence of…
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…
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 increases the number of components of is called a cut vertex. For all , we determine the maximum number of connected induced subgraph…
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,…