Forcing super domination number of a graph

DOI10.17654/DM019040339MaRDI QIDQ4973408zbMATH OpenOpenAlexFDO

Authors Remilou Liguarda, S. R. Canoy

Publication date 27 November 2019

Published in Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17654/dm019040339

zbMATH Keywords

dominationjoinforcing dominationforcing super dominationsuper domination

Mathematics Subject Classification ID

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

Recommendations

• Super domination in graphs
• CONNECTED SUPER DOMINATION IN GRAPHS
• Super domination in trees
• On the super domination number of graphs
• Bounds on the forcing domination number of graphs

Cites work

• scientific article; zbMATH DE number 1208724 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Secure total domination in graphs
• Super dominating sets in graphs
• Super domination in graphs
• The Forcing Convexity Number of a Graph
• The forcing hull number of a graph

Cited in

(3)

• Super dominating sets in graphs
• Super domination in graphs
• Super domination in trees

This page was built for publication: Forcing super domination number of a graph

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