Edge criticality in signed graphs admitting a Roman dominating function
From MaRDI portal
Cites work
- Double Roman domination
- Lower and upper bounds on independent double Roman domination in trees
- On the notion of balance of a signed graph
- On the total and strong version for Roman dominating functions in graphs
- Roman \(\{ 3 \}\)-domination (double Italian domination)
- Roman \(\{2 \}\)-domination
- Roman domination in graphs.
- Roman domination in signed graphs
- Roman domination number of signed graphs
- Signed graphs
- Signed Total Strong Roman Domination in Graphs
- Vertex and edge critical Roman domination in graphs
This page was built for publication: Edge criticality in signed graphs admitting a Roman dominating function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230026)