Vertex and edge critical Roman domination in graphs
From MaRDI portal
Publication:2870947
zbMATH Open1293.05264MaRDI QIDQ2870947FDOQ2870947
Authors: Nader Jafari Rad, Adriana Hansberg, Lutz Volkmann 
Publication date: 21 January 2014
Published in: Utilitas Mathematica (Search for Journal in Brave)
Recommendations
Cited In (25)
- Title not available (Why is that?)
- Total Roman domination edge-critical graphs
- On the Roman domination stable graphs
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Characterization of perfect Roman domination edge critical trees
- A counterexample to a conjecture of Jafari Rad and Volkmann
- Edge Roman domination on graphs
- 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)
