Distance Roman domination in random graphs

MaRDI QIDQ4627397zbMATH OpenFDO

Authors Elahe Sharifi, Nader Jafari Rad

Publication date 7 March 2019

zbMATH Keywords

random graphdominationRoman dominationdistance domination

Mathematics Subject Classification ID

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

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)

• Varieties of Roman domination. II
• The distance Roman domatic number of a graph
• The distance Roman domination numbers of graphs
• Small domination-type invariants in random 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)