Toward a Nordhaus-Gaddum inequality for the number of dominating sets
From MaRDI portal
Publication:2278638
DOI10.2140/INVOLVE.2019.12.1175zbMath1428.05234arXiv1808.05576OpenAlexW2885810669WikidataQ126985877 ScholiaQ126985877MaRDI QIDQ2278638
Publication date: 5 December 2019
Published in: Involve (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.05576
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Graphs with few total dominating sets
- Nordhaus-Gaddum inequalities for domination in graphs
- A survey of Nordhaus-Gaddum type relations
- Majorization and the minimum number of dominating sets
- On Complementary Graphs
- Extremal Regular Graphs: Independent Sets and Graph Homomorphisms
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Toward a Nordhaus-Gaddum inequality for the number of dominating sets