Upper bounds for the Roman domination subdivision number of a graph

zbMATH Open1148.05312MaRDI QIDQ950653FDOQ950653

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

Publication date: 3 November 2008

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

Recommendations

• Roman domination subdivision number of graphs
• On the Roman domination subdivision number of a graph
• Roman domination subdivision number of a graph and its complement.
• Total Roman domination subdivision number in graphs
• Trees whose Roman domination subdivision number is 2

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 (10)

• Secure domination subdivision number of a graph
• Trees whose Roman domination subdivision number is 2
• Block graphs with large paired domination multisubdivision number
• Roman domination subdivision number of graphs
• On the Roman domination subdivision number of a graph
• Extremal digraphs for an upper bound on the Roman domination number
• On [k]-Roman domination subdivision number of graphs
• Roman domination in graphs
• Roman game domination subdivision number of a graph
• Roman domination subdivision number of a graph and its complement.

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)