On efficiently Roman dominatable graphs

MaRDI QIDQ3620770zbMATH OpenFDO

Authors P. Roushini, Leely Pushpam, T. N. M. Malini Mai

Publication date 14 April 2009

zbMATH Keywords

efficient Roman dominating functionefficient Roman domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Roman domination in graphs.
• The Roman \(\{2 \}\)-domatic number of graphs
• Roman domination in regular graphs
• On the total Roman domination number of graphs.
• Roman domination dot-critical graphs

Cited in

(12)

• Effect of vertex deletion on the weak Roman domination number of a graph
• scientific article; zbMATH DE number 7362655 (Why is no real title available?)
• Resolving Roman domination in graphs
• scientific article; zbMATH DE number 7509363 (Why is no real title available?)
• Restrained Roman domination in graphs
• Secure vertex cover of a graph
• An algorithm to recognize weak Roman domination stable trees under vertex deletion
• Efficient algorithms for independent Roman domination on some classes of graphs
• Chromatic transversal Roman domination in graphs
• scientific article; zbMATH DE number 7693181 (Why is no real title available?)
• Double Roman domination in some graphs
• Global Roman domination in graphs

This page was built for publication: On efficiently Roman dominatable graphs

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