Vertex and edge critical Roman domination in graphs
From MaRDI portal
Publication:2870947
Recommendations
Cited in
(25)- scientific article; zbMATH DE number 6470880 (Why is no real title available?)
- Total Roman domination edge-critical graphs
- On the Roman domination stable graphs
- scientific article; zbMATH DE number 6509342 (Why is no real title available?)
- Characterization of trees with Roman bondage number 1
- Roman domination edge critical graphs having precisely two cycles.
- Changing and unchanging the roman domination number of graph
- Roman \(k\)-domination number upon vertex and edge removal
- Roman domination dot-critical graphs
- Some results on roman domination edge critical graphs
- Edge lifting and Roman domination in graphs
- Characterization of perfect Roman domination edge critical trees
- Edge Roman domination on graphs
- scientific article; zbMATH DE number 7693181 (Why is no real title available?)
- A counterexample to a conjecture of Jafari Rad and Volkmann
- Roman domination dot-critical trees
- Characterization of Roman domination critical unicyclic graphs
- A note on Roman domination: changing and unchanging
- Total Roman domination edge-supercritical and edge-removal-supercritical graphs
- Criticality indices of Roman domination of paths and cycles
- Roman domination in graphs
- Roman domination in graphs: the class \(\mathcal{R}_{UVR}\)
- Roman domination excellent graphs: trees
- Critical graphs with Roman domination number four
- A generalization of roman domination critical graphs
This page was built for publication: Vertex and edge critical Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870947)
