Distance Roman domination in random graphs

MaRDI QIDQ4627397zbMATH OpenFDO

Authors Elahe Sharifi, Nader Jafari Rad

Publication date 7 March 2019

zbMATH Keywords

distance dominationdominationrandom graphRoman domination

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• The distance Roman domination numbers of graphs
• The distance Roman domatic number of a graph
• Roman \(k\)-domination in graphs
• A note on k-Roman graphs
• Roman domination in graphs.

Cited in

(4)

• The distance Roman domatic number of a graph
• Small domination-type invariants in random graphs
• Varieties of Roman domination. II
• The distance Roman domination numbers of graphs

This page was built for publication: Distance Roman domination in random graphs

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