Roman bondage in graphs
From MaRDI portal
Publication:2906359
DOI10.7151/DMGT.1578zbMATH Open1255.05137OpenAlexW2078588121MaRDI QIDQ2906359FDOQ2906359
Authors: Nader Jafari Rad, Lutz Volkmann 
Publication date: 5 September 2012
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/45d316952000e7187a5c563b8b0d56cfab94029f
Recommendations
Cited In (23)
- A note on the Roman bondage number of planar graphs
- Upper bounds on Roman domination numbers of graphs
- A note of Roman bondage number of graphs.
- Independent Roman bondage of graphs
- Characterization of trees with Roman bondage number 1
- On the double Roman bondage numbers of graphs
- Title not available (Why is that?)
- A Roman domination chain
- Roman domination dot-critical graphs
- On bondage numbers of graphs: a survey with some comments
- Roman \(\{2\}\)-bondage number of a graph
- On the Roman bondage number of planar graphs
- The Roman bondage number of a digraph
- Weak Roman bondage number of a graph
- Independent k -rainbow bondage number of graphs
- Roman fractional bondage number of a graph
- On the Roman \(k\)-bondage number of a graph
- Roman domination in graphs
- Roman domination in graphs: the class \(\mathcal{R}_{UVR}\)
- On the Roman bondage number of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Roman bondage numbers of some graphs
This page was built for publication: Roman bondage in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906359)
