A note on the Roman bondage number of planar graphs
From MaRDI portal
Publication:2376083
DOI10.1007/S00373-011-1129-8zbMATH Open1273.05159OpenAlexW2050502377MaRDI QIDQ2376083FDOQ2376083
Authors: Mahdad Khatirinejad, Sahar Qajar, S. Akbari 
Publication date: 26 June 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1129-8
Recommendations
- On the Roman bondage number of planar graphs
- On the Roman bondage number of a graph
- On the Roman \(k\)-bondage number of a graph
- Remarks on the bondage number of planar graphs
- Note on conjectures of bondage numbers of planar graphs
- On the double Roman bondage numbers of graphs
- Roman \(\{2\}\)-bondage number of a graph
- Quasi-total Roman bondage number in graphs
- Bondage number of planar graphs
- On the bondage number of planar and directed graphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
Cited In (11)
- A note of Roman bondage number of graphs.
- Remarks on the bondage number of planar graphs
- Characterization of trees with Roman bondage number 1
- Quasi-total Roman bondage number in graphs
- On the double Roman bondage numbers of graphs
- On bondage numbers of graphs: a survey with some comments
- Upper bounds for domination related parameters in graphs on surfaces
- The \(k\)-rainbow bondage number of a graph
- Roman \(\{2\}\)-bondage number of a graph
- On the Roman bondage number of planar graphs
- Roman domination in graphs
This page was built for publication: A note on the Roman bondage number of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376083)
