Further results on secure restrained domination in graphs
From MaRDI portal
Publication:5069776
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 2094533 (Why is no real title available?)
- scientific article; zbMATH DE number 2104838 (Why is no real title available?)
- scientific article; zbMATH DE number 2114685 (Why is no real title available?)
- scientific article; zbMATH DE number 2188604 (Why is no real title available?)
- scientific article; zbMATH DE number 2188623 (Why is no real title available?)
- Irredundance, secure domination and maximum degree in trees
- Restrained domination in cubic graphs
- Restrained domination in graphs
- Restrained domination in trees
- Restrained domination in unicyclic graphs
- Secure restrained domination in graphs
Cited in
(7)- Restrained domination in self-complementary graphs
- Secure restrained domination in graphs
- Global restrained domination number of a graph
- Eternal and Secure Domination in Graphs
- \(m\)-secure vertex cover of a graph
- Movable restrained-domination in the Corona of graphs
- Restrained double domination number of a graph
This page was built for publication: Further results on secure restrained domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069776)