Upper bounds for the Roman domination subdivision number of a graph

MaRDI QIDQ950653zbMATH OpenFDO

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)

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)

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

Cited in

(10)

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

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)