Recommendations
Cited in
(28)- Bounds on the locating Roman domination number in trees
- Effect of vertex deletion on the weak Roman domination number of a graph
- Outer-independent total Roman domination in graphs
- On perfect Roman domination number in trees: complexity and bounds
- On the strong Roman domination number of graphs
- Roman edge semi-total block domination of a graph
- Minimal and maximal e=1 functions
- On the Roman edge domination number of a graph
- Smarandachely Roman edge s-dominating function
- Weak edge Roman domination in graphs
- Varieties of Roman Domination
- Edge Roman domination on graphs
- scientific article; zbMATH DE number 6509342 (Why is no real title available?)
- A note on the edge Roman domination in trees
- Edge lifting and Roman domination in graphs
- scientific article; zbMATH DE number 7509363 (Why is no real title available?)
- scientific article; zbMATH DE number 7527889 (Why is no real title available?)
- Restrained Roman domination in graphs
- Secure vertex cover of a graph
- scientific article; zbMATH DE number 6470880 (Why is no real title available?)
- An algorithm to recognize weak Roman domination stable trees under vertex deletion
- Chromatic transversal Roman domination in graphs
- scientific article; zbMATH DE number 7693181 (Why is no real title available?)
- EDGE ITALIAN DOMINATION OF SOME GRAPH PRODUCTS
- Combinatorial spectra using polynomials.
- Double Roman domination in some graphs
- Global Roman domination in graphs
- Roman edge domination in graphs
This page was built for publication: Edge roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565899)
