Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs
| Auteur | DOSSOU OLORY, AUDACE AMEN VIOUTOU | |
| Auteur | ANDRIANTIANA, ERIC O D | |
| Date d'ajout | 2026-06-02T16:06:57Z | |
| Date de disponibilite | 2026-06-02T16:06:57Z | |
| Date de publication | 2022 | |
| Resume | Let η(G) be the number of connected induced subgraphs in a graph G, and Ḡ the complement of G. We prove that η(G) + η(Ḡ) is minimum, among all n-vertex graphs, if and only if G has no induced path on four vertices. Since the n-vertex star Sn with maximum degree n − 1 is the unique tree of diameter 2, is minimum among all n-vertex trees, while the maximum is shown to be achieved only by the tree whose degree sequence is (⌈n/2⌉, ⌊n/2⌋, 1, . . . , 1). Furthermore, we prove that every graph G of order n ≥ 5 and with maximum η(G) + η(Ḡ) must have diameter at most 3, no cut vertex and the property that G is also connected. In both cases of trees and graphs that have the same order, we find that if η(G) is maximum then η(G) + η(Ḡ) is minimum. As corollaries to our results, we characterise the unique connected graph G of given order and number of vertices of degree 1, and the unique connected graph G of a given order satisfying |V (G)| = |E(G)| that minimises η(G) + η(Ḡ). | |
| DOI | 10.2989/16073606.2021.1934178 | |
| Autre identifiant | BECDB-13691 | |
| URI | https://dspace.uac.bj/handle/123456789/11711 | |
| Langue | fr | |
| Fait partie de | Quaestiones Mathematicae | |
| Sujet | Nordhaus-Gaddum inequalities | |
| Sujet | Induced subgraphs | |
| Sujet | connected graphs | |
| Sujet | trees | |
| Sujet | pendent vertices | |
| Titre | Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs | |
| Type | Article |