On the forcing domination and the forcing total domination numbers of a graph
From MaRDI portal
Publication:2165253
Recommendations
Cites work
- A new upper bound on the total domination number of a graph
- A survey of selected recent results on total domination in graphs
- scientific article; zbMATH DE number 1208724 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1462928 (Why is no real title available?)
- scientific article; zbMATH DE number 2188378 (Why is no real title available?)
- On the total domination number of graphs
- Total domination in graphs
Cited in
(15)- On the total forcing number of a graph
- Total forcing versus total domination in cubic graphs
- Bounds on the forcing domination number of graphs
- scientific article; zbMATH DE number 5016666 (Why is no real title available?)
- 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 2114682 (Why is no real title available?)
- The forcing nonsplit domination number of a graph
- THE FORCING HOP DOMINATION NUMBER OF A GRAPH
- scientific article; zbMATH DE number 5194492 (Why is no real title available?)
- scientific article; zbMATH DE number 7659944 (Why is no real title available?)
- Complete forcing numbers of complete and almost-complete multipartite graphs
- THE FORCING CONVEX DOMINATION NUMBER OF A GRAPH
- THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH
- The forcing geodetic global domination number of a graph
This page was built for publication: On the forcing domination and the forcing total domination numbers of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2165253)