Nordhaus-Gaddum bounds for total domination
From MaRDI portal
Publication:2430063
DOI10.1016/j.aml.2011.01.011zbMath1221.05260OpenAlexW2048585464MaRDI QIDQ2430063
Michael A. Henning, Ernst J. Joubert, Justin Southey
Publication date: 5 April 2011
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2011.01.011
Related Items
Nordhaus-Gaddum bounds for upper total domination ⋮ Multiple factor Nordhaus-Gaddum type results for domination and total domination ⋮ Nordhaus-Gaddum bounds for locating domination ⋮ Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connected domination number of a graph and its complement
- Total domination of graphs and small transversals of hypergraphs
- A survey of selected recent results on total domination in graphs
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Nordhaus--Gaddum bounds for independent domination
- A note on Nordhaus-Gaddum inequalities for domination.
- Nordhaus-Gaddum inequalities for domination in graphs
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- On Complementary Graphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Total domination in graphs
- Domination-balanced graphs
- Some nordhaus‐‐ gaddum‐type results
- Some remarks on domination
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts
