Roman domination subdivision number of a graph and its complement.

MaRDI QIDQ2931473zbMATH OpenFDO

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

Publication date 25 November 2014

zbMATH Keywords

domination in a graphRoman domination number

Mathematics Subject Classification ID

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

Recommendations

• Upper bounds for the Roman domination subdivision number of a graph
• Roman domination subdivision number of graphs
• On the Roman domination subdivision number of a graph
• A Nordhaus-Gaddum bound for Roman domination
• Extremal problems for roman domination

Cited in

(9)

• Roman domination in graphs
• Roman domination in complementary prism graphs
• Secure domination subdivision number of a graph
• A Nordhaus-Gaddum bound for Roman domination
• Double Roman domination subdivision number in graphs
• On [k]-Roman domination subdivision number of graphs
• Roman domination subdivision number of graphs
• On the Roman domination subdivision number of a graph
• Upper bounds for the Roman domination subdivision number of a graph

This page was built for publication: Roman domination subdivision number of a graph and its complement.

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