Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs
From MaRDI portal
Publication:5039404
DOI10.2989/16073606.2021.1934178zbMath1498.05129arXiv2006.01187OpenAlexW3172259665MaRDI QIDQ5039404
Eric Ould Dadah Andriantiana, Audace A. V. Dossou-Olory
Publication date: 12 October 2022
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.01187
Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy trees, subtrees and antichains
- The Nordhaus-Gaddum-type inequality for the Wiener polarity index
- Monotonicity of the mean order of subtrees
- Binary trees with the largest number of subtrees
- The extremal values of the Wiener index of a tree with given degree sequence
- Corrigendum: The extremal values of the Wiener index of a tree with given degree sequence
- The connectivity of a graph and its complement
- On subtrees of trees
- On the average number of nodes in a subtree of a tree
- Nordhaus-Gaddum inequalities for domination in graphs
- A survey of Nordhaus-Gaddum type relations
- Cut and pendant vertices and the number of connected induced subgraphs of a graph
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- On Complementary Graphs
- The number of subtrees of trees with given diameter
- On the Number of Nonisomorphic Subtrees of a Tree
- The topological trees with extreme Matula numbers
- Reflexible complete regular dessins and antibalanced skew morphisms of cyclic groups
- Wiener index, number of subtrees, and tree eccentric sequence
- Trees with large numbers of subtrees
- Enumerating connected induced subgraphs: improved delay and experimental comparison
This page was built for publication: Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs
