THE FORCING HOP DOMINATION NUMBER OF A GRAPH
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1208724
- scientific article; zbMATH DE number 5016666
- On the forcing connected domination number of a graph
- On the forcing domination and the forcing total domination numbers of a graph
- The forcing hull number of a graph
- scientific article; zbMATH DE number 5194492
- The forcing nonsplit domination number of a graph
- Bounds on the forcing domination number of graphs
- On the total forcing number of a graph
- Forcing domination numbers of graphs under some binary operations
Cites work
- Hop domination in graphs. II
- scientific article; zbMATH DE number 5575482 (Why is no real title available?)
- scientific article; zbMATH DE number 1208724 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- On the forcing geodetic and forcing steiner numbers of a graph
- The forcing edge fixing edge-to-vertex monophonic number of a graph
- The forcing edge monophonic number of a graph
- The forcing geodetic number of a graph
- The forcing near geodetic number of a graph
- The forcing Steiner number of a graph
- The upper edge geodetic number and the forcing edge geodetic number of a graph
- Total and forcing total edge-to-vertex monophonic number of a graph
Cited in
(3)
This page was built for publication: THE FORCING HOP DOMINATION NUMBER OF A GRAPH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075602)