scientific article; zbMATH DE number 7509363
From MaRDI portal
Publication:5070078
Cites work
- A mixed integer linear programming formulation for restrained Roman domination problem
- An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
- Bounds on Roman domination numbers of graphs
- Bounds on the restrained Roman domination number of a graph
- Defending the Roman Empire---a new strategy
- Edge roman domination in graphs
- Effect of vertex deletion on the weak Roman domination number of a graph
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- NP-completeness and APX-completeness of restrained domination in graphs
- On efficiently Roman dominatable graphs
- On roman, global and restrained domination in graphs
- Restrained domination in graphs
- Restrained domination in trees
- Restrained Roman domination in graphs
- Roman domination in graphs.
- Upper bounds on Roman domination numbers of graphs
- Weak Roman domination in graphs
Cited in
(4)
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 Q5070078)