Signed Roman edge domination numbers in graphs
From MaRDI portal
Publication:5963625
Recommendations
Cites work
- scientific article; zbMATH DE number 5556292 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- On signed edge domination numbers of graphs
- On signed edge domination numbers of trees
- Signed Roman domination in digraphs
- Signed Roman domination in graphs
- Signed edge domination numbers in trees
- Some notes on signed edge domination in graphs
- The signed Roman domatic number of a graph
- Two classes of edge domination in graphs
Cited in
(12)- Varieties of Roman domination. II
- Signed edge majority domination numbers in graphs
- The signed Roman domination number of two classes graphs
- Computing Roman domatic number of graphs
- Signed total Roman edge domination in graphs
- The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\)
- On the signed Roman edge \(k\)-domination in graphs
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- Signed mixed Roman domination numbers in graphs
- Signed Roman edge \(k\)-domination in graphs
- Bounds on signed total double Roman domination
- On the strong Roman domination number of graphs
This page was built for publication: Signed Roman edge domination numbers in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963625)