Multiple factor Nordhaus-Gaddum type results for domination and total domination
From MaRDI portal
Publication:423926
DOI10.1016/j.dam.2011.11.031zbMath1242.05203OpenAlexW2056007126MaRDI QIDQ423926
Ernst J. Joubert, Michael A. Henning, Justin Southey
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.031
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on the total restrained domination number of a graph
- A survey of selected recent results on total domination in graphs
- Nordhaus--Gaddum bounds for independent domination
- A note on Nordhaus-Gaddum inequalities for domination.
- Nordhaus-Gaddum inequalities for domination in graphs
- Nordhaus-Gaddum bounds for total domination
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- On Complementary Graphs
- Total domination in graphs
- Domination-balanced graphs
- Some nordhaus‐‐ gaddum‐type results
- Bounds on chromatic numbers of multiple factors of a complete graph
- Towards a theory of domination in graphs
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts
This page was built for publication: Multiple factor Nordhaus-Gaddum type results for domination and total domination
