Upper bounds for the Roman domination subdivision number of a graph

zbMATH Open1148.05312MaRDI QIDQ950653FDOQ950653

Abdollah Khodkar, Seyed Mahmood Sheikholeslami, B. P. Mobaraky

Publication date: 3 November 2008

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Roman domination numberRoman domination subdivision numberdomination in graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (5)

• Roman Domination in Graphs
• Secure domination subdivision number of a graph
• Block graphs with large paired domination multisubdivision number
• On the Roman domination subdivision number of a graph
• Extremal digraphs for an upper bound on the Roman domination number

This page was built for publication: Upper bounds for the Roman domination subdivision number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950653)