Forcing super domination number of a graph

DOI10.17654/DM019040339zbMATH Open1425.05119OpenAlexW2899241665MaRDI QIDQ4973408FDOQ4973408

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

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

zbMATH Keywords

dominationjoinforcing dominationforcing super dominationsuper domination

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Secure total domination in graphs
• Title not available (Why is that?)
• Super dominating sets in graphs
• The forcing hull number of a graph
• The Forcing Convexity Number of a Graph

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)