scientific article; zbMATH DE number 5575482
From MaRDI portal
Publication:3635455
Recommendations
- Domination parameters in Mycielski graphs
- scientific article; zbMATH DE number 5123583
- On the forcing domination and the forcing total domination numbers of a graph
- Bounds on the forcing domination number of graphs
- Efficient domination in Mycielski's graphs
- On the forcing connected domination number of a graph
- Forcing domination numbers of graphs under some binary operations
- scientific article; zbMATH DE number 5194492
- scientific article; zbMATH DE number 1208724
- On Domination in Graphs
Cited in
(12)- Trees with independent Roman domination number twice the independent domination number
- scientific article; zbMATH DE number 5123583 (Why is no real title available?)
- On dominator colorings in graphs
- The forcing nonsplit domination number of a graph
- THE FORCING HOP DOMINATION NUMBER OF A GRAPH
- The identifying code number and Mycielski's construction of graphs
- Domination parameters in Mycielski graphs
- On the watching number of graphs
- On the existence problem of the total domination vertex critical graphs
- Further results on the hop domination number of a graph
- Eccentric and leap eccentric connectivity indices of some Mycielski graphs
- Bondage numbers of Mycielski graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635455)
