Signed Roman edge domination numbers in graphs
DOI10.1007/S10878-014-9747-8zbMATH Open1331.05165OpenAlexW2025437641MaRDI QIDQ5963625FDOQ5963625
Lutz Volkmann, H. Abdollahzadeh Ahangar, Seyed Mahmood Sheikholeslami, Yancai Zhao, J. Amjadi
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9747-8
Recommendations
signed Roman dominating functionsigned Roman domination numbersigned Roman edge dominating functionsigned Roman edge domination number
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Signed Roman domination in graphs
- Two classes of edge domination in graphs
- Signed Roman domination in digraphs
- Title not available (Why is that?)
- On signed edge domination numbers of trees
- Some notes on signed edge domination in graphs
- On signed edge domination numbers of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- 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)\)
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- Signed mixed Roman domination numbers in graphs
- Varieties of Roman domination II
- 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)
