Complexity of comparing the domination number to the independent domination, connected domination, and paired domination numbers

DOI10.21711/231766362015/RMC445MaRDI QIDQ6489440zbMATH OpenFDO

Authors José D. Alvarado, Simone Dantas, Dieter Rautenbach

Publication date 22 April 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

zbMATH Keywords

domination numberNP-hardindependent domination numberpaired domination numberconnected domination number

Mathematics Subject Classification ID

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

Recommendations

• Perfectly relating the domination, total domination, and paired domination numbers of a graph
• Some inequalities about connected domination number
• Strong equality of domination parameters in trees
• scientific article; zbMATH DE number 1135751
• An inequality on connected domination parameters

This page was built for publication: Complexity of comparing the domination number to the independent domination, connected domination, and paired domination numbers

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