Multiple factor Nordhaus-Gaddum type results for domination and total domination

DOI10.1016/J.DAM.2011.11.031MaRDI QIDQ423926zbMATH OpenOpenAlexFDO

Authors Michael A. Henning, Ernst J. Joubert, 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

zbMATH Keywords

dominationtotal dominationNordhaus-Gaddum

Mathematics Subject Classification ID

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

Recommendations

• Nordhaus-Gaddum type results for total domination
• Nordhaus-Gaddum bounds for total domination
• A note on Nordhaus-Gaddum inequalities for domination.
• Nordhaus-Gaddum bounds for total Roman domination
• Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs

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.
• A survey of selected recent results on total domination in graphs
• Bounds on chromatic numbers of multiple factors of a complete graph
• Bounds on the total restrained domination number of a graph
• Domination-balanced graphs
• Nordhaus--Gaddum bounds for independent domination
• 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 Theorems for decompositions into many parts
• On Complementary Graphs
• Some nordhaus‐‐ gaddum‐type results
• Total domination in graphs
• Towards a theory of domination in graphs

Cited in

(4)

• Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs
• Nordhaus-Gaddum bounds for total domination
• Nordhaus-Gaddum type results for total domination
• Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars

This page was built for publication: Multiple factor Nordhaus-Gaddum type results for domination and total domination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423926)