A note on the Roman bondage number of planar graphs
From MaRDI portal
Publication:2376083
DOI10.1007/s00373-011-1129-8zbMath1273.05159MaRDI QIDQ2376083
Sahar Qajar, Mahdad Khatirinejad, Saieed 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
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
On the double Roman bondage numbers of graphs, Upper bounds for domination related parameters in graphs on surfaces, The \(k\)-rainbow bondage number of a graph, On bondage numbers of graphs: a survey with some comments, Characterization of trees with Roman bondage number 1, Roman \(\{2\}\)-bondage number of a graph, Roman Domination in Graphs
Cites Work