Roman domination in regular graphs

DOI10.1016/J.DISC.2008.03.006MaRDI QIDQ1024464zbMATH OpenOpenAlexFDO

Authors Fu Xueliang, Yuansheng Yang, Jiang Baoqi

Publication date 17 June 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2008.03.006

zbMATH Keywords

regular graphroman domination numberRoman graph

Mathematics Subject Classification ID

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

Recommendations

• Roman domination in graphs.
• Roman domination number of generalized Petersen graphs \(P(n,2)\).
• On the Roman domination polynomial of graphs
• A note on Roman domination in graphs
• On the Roman domination number of a graph

Cites work

• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• A characterization of Roman trees
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• On the domination number of generalized Petersen graphs \(P(n,3)\).
• Roman domination in graphs.

Cited in

(37)

• Co-Roman domination in graphs
• scientific article; zbMATH DE number 6129508 (Why is no real title available?)
• Restrained Roman domination in graphs
• Minimal Roman dominating functions: extensions and enumeration
• ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
• Roman domination dot-critical graphs
• On the strong Roman domination number of graphs
• A note on Roman domination of digraphs
• Perfect Roman domination in regular graphs
• Computing Roman domatic number of graphs
• The global Roman domination number of torus graphs and generalized Petersen graphs
• A continuous generalization of domination-like invariants
• The Roman domination number of some special classes of graphs - convex polytopes
• Vertex-addition strategy for domination-like invariants
• Roman domination number of generalized Petersen graphs \(P(n,2)\).
• On efficiently Roman dominatable graphs
• scientific article; zbMATH DE number 6813626 (Why is no real title available?)
• On the \(k\)-strong Roman domination problem
• Nearly tight approximation algorithm for (connected) Roman dominating set
• On the roman domination in the lexicographic product of graphs
• On the roman domination number of generalized Sierpiński graphs
• Quasi-total Roman domination in graphs
• 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
• scientific article; zbMATH DE number 7589547 (Why is no real title available?)
• The geodetic domination number of comb product graphs
• Total Roman domination in digraphs
• Roman domination number of the Cartesian products of paths and cycles
• Minimal Roman dominating functions: extensions and enumeration
• Roman domination in graphs
• Roman domination in graphs.
• scientific article; zbMATH DE number 7491370 (Why is no real title available?)
• Global Roman domination in graphs
• Roman domination in subgraphs of grids
• A note on Roman domination in graphs
• scientific article; zbMATH DE number 7366787 (Why is no real title available?)
• Weak Roman domination in graphs
• Roman domination and independent Roman domination on graphs with maximum degree three

This page was built for publication: Roman domination in regular graphs

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