Equivalence domination in graphs

DOI10.2989/16073606.2013.779959MaRDI QIDQ2862837zbMATH OpenOpenAlexFDO

Authors S. Arumugam, Mustapha Chellali, Teresa W. Haynes

Publication date 19 November 2013

Published in Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2989/16073606.2013.779959

zbMATH Keywords

total dominationequivalence dominationP3-forming set

Mathematics Subject Classification ID

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

Recommendations

• On equality in an upper bound for the equivalence domination number
• Equivalence dominating sets in graphs
• Equivalence domination number of a tree
• On \(k\)-equivalence domination in graphs
• Degree equitable domination on graphs

Cited in

(9)

• On equality in an upper bound for the equivalence domination number
• On \(k\)-equivalence domination in graphs
• The Domination Equivalence Classes of Paths
• Equivalence dominating sets in graphs
• The parameterized complexity of the equidomination problem
• Domination equivalence in graphs
• Equivalence domination number of a tree
• The equivalence chain of a graph
• A class of threshold and domishold graphs: Equistable and equidominating graphs

This page was built for publication: Equivalence domination in graphs

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