A note on the Roman bondage number of planar graphs

DOI10.1007/s00373-011-1129-8zbMath1273.05159OpenAlexW2050502377MaRDI 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

zbMATH Keywords

Roman bondage numberRoman domination number

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Characterization of trees with Roman bondage number 1 ⋮ Upper bounds for domination related parameters in graphs on surfaces ⋮ The \(k\)-rainbow bondage number of a graph ⋮ On the double Roman bondage numbers of graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Roman \(\{2\}\)-bondage number of a graph ⋮ Roman Domination in Graphs

Cites Work

• On the Roman bondage number of planar graphs
• Bondage number of planar graphs
• On the bondage number of planar and directed graphs
• Roman bondage in graphs
• On light subgraphs in plane graphs of minimum degree five

This page was built for publication: A note on the Roman bondage number of planar graphs