Strong equality of domination parameters in graphs

MaRDI QIDQ4898159zbMATH OpenFDO

Authors Xuegang Chen, De-Xiang Ma

Publication date 29 December 2012

zbMATH Keywords

connected domination numbercubic graphsdomination numberstrong equalitytotal domination numbertrees

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Strong equality of domination parameters in trees
• On strong domination number of graphs
• Strong equality of upper domination and independence in trees
• Graphs with strong equality on paired and double domination numbers
• On graphs with equal domination and connected domination numbers

Cited in

(6)

• Strong equality of upper domination and independence in trees
• Equivalence dominating sets in graphs
• Graphs with strong equality on paired and double domination numbers
• Triangulations and equality in the domination chain
• Equality co-neighborhood domination in graphs
• scientific article; zbMATH DE number 5244573 (Why is no real title available?)

This page was built for publication: Strong equality of domination parameters in graphs

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