Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars

DOI10.1016/j.dam.2017.04.016zbMath1365.05221OpenAlexW2620326804MaRDI QIDQ2357136

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

zbMATH Keywords

total dominationrelative complementNordhaus-Gaddum-type results

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Nordhaus-Gaddum and other bounds for the chromatic edge-stability number ⋮ On \(k\)-rainbow independent domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Some nordhaus‐‐ gaddum‐type results
• Bounds on chromatic numbers of multiple factors of a complete graph
• Nordhaus–Gaddum‐type Theorems for decompositions into many parts

This page was built for publication: Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars