Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
From MaRDI portal
Publication:2357136
DOI10.1016/J.DAM.2017.04.016zbMATH Open1365.05221OpenAlexW2620326804MaRDI QIDQ2357136FDOQ2357136
Authors: Ernst J. Joubert 
Publication date: 19 June 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.04.016
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total domination in graphs
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- On Complementary Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some nordhaus‐‐ gaddum‐type results
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts
- Nordhaus-Gaddum inequalities for domination in graphs
- Title not available (Why is that?)
- A note on Nordhaus-Gaddum inequalities for domination.
- Nordhaus-Gaddum bounds for total domination
- Bounds on chromatic numbers of multiple factors of a complete graph
- Nordhaus-Gaddum type results for total domination
Cited In (4)
This page was built for publication: Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357136)
