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

DOI10.1016/J.DAM.2017.04.016MaRDI QIDQ2357136zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

total dominationrelative complementNordhaus-Gaddum-type results

Mathematics Subject Classification ID

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

Recommendations

• Nordhaus-Gaddum bounds for total domination
• Nordhaus-Gaddum type results for total domination
• Multiple factor Nordhaus-Gaddum type results for domination and total domination
• Nordhaus-Gaddum bounds for total Roman domination
• Nordhaus-Gaddum bounds for upper total domination

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1109413 (Why is no real title available?)
• scientific article; zbMATH DE number 3335815 (Why is no real title available?)
• scientific article; zbMATH DE number 3358515 (Why is no real title available?)
• A note on Nordhaus-Gaddum inequalities for domination.
• Bounds on chromatic numbers of multiple factors of a complete graph
• Nordhaus-Gaddum bounds for total domination
• Nordhaus-Gaddum inequalities for domination in graphs
• Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
• Nordhaus-Gaddum type results for total domination
• Nordhaus–Gaddum‐type Theorems for decompositions into many parts
• On Complementary Graphs
• Some nordhaus‐‐ gaddum‐type results
• Total domination in graphs

Cited in

(4)

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

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)