Signed Roman domination in graphs
From MaRDI portal
Recommendations
Cites work
- A characterization of Roman trees
- A note on the lower bounds of signed domination number of a graph
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Defending the Roman Empire from multiple attacks
- Defending the Roman Empire---a new strategy
- Extremal problems for roman domination
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1124595 (Why is no real title available?)
- scientific article; zbMATH DE number 861417 (Why is no real title available?)
- scientific article; zbMATH DE number 2188604 (Why is no real title available?)
- R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
- Roman domination in graphs.
- Signed domination in regular graphs
- Signed domination in regular graphs and set-systems
Cited in
(78)- Improved integer linear programming formulation for weak Roman domination problem
- Bounds on the signed Roman \(k\)-domination number of a digraph
- Bounds on the locating Roman domination number in trees
- Bounds on the domination number of a digraph
- Signed double Roman domination in graphs
- A characterization of double Roman trees
- Double Roman domination number
- The Roman domatic problem in graphs and digraphs: a survey
- Perfect Italian domination in graphs: complexity and algorithms
- The signed edge-domatic number of nearly cubic graphs
- On the \(k\)-strong Roman domination problem
- Double Roman domination in digraphs
- Algorithmic results on double Roman domination in graphs
- Outer-independent total Roman domination in graphs
- On perfect Roman domination number in trees: complexity and bounds
- Perfect Roman domination in graphs
- Signed Roman \(k\)-domination in trees
- On the strong Roman domination number of graphs
- On the signed Roman k-domination: complexity and thin torus graphs
- Total Roman domination in the lexicographic product of graphs
- Perfect Italian domination in cographs
- Computing Roman domatic number of graphs
- Signed Roman \(k\)-domination in digraphs
- On the signed total Roman domination and domatic numbers of graphs
- Signed total Roman domination in graphs
- Signed mixed Roman domination numbers in graphs
- Edge Roman domination on graphs
- Signed Roman (total) domination numbers of complete bipartite graphs and wheels
- Signed double Roman \(k\)-domination in graphs
- Roman domination excellent graphs: trees
- Lower and upper bounds on the strong Roman dominator number in graphs
- The signed Roman \(k\)-domatic number of a graph
- The signed Roman domatic number of a graph
- Varieties of Roman domination. II
- SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
- Weak signed Roman domination in graphs
- Nonnegative signed total Roman domination in graphs
- Bounds on signed total double Roman domination
- Weak signed Roman \(k\)-domination in graphs
- The signed Roman domination number of two classes graphs
- On the signed strong Roman domination number of graphs
- Signed strong Roman domination in graphs
- Signed Roman domination in digraphs
- The signed Roman domatic number of a digraph
- Majority Roman domination in graphs
- Weak signed Roman domination in digraphs
- Signed Roman edge k-domination in graphs
- Signed double roman domination of graphs
- On the signed Roman k-domination in graphs
- Nonnegative signed Roman domination in graphs
- Characterization of perfect Roman domination edge critical trees
- Signed total double Roman \(k\)-domination in graphs
- Bounds for signed double Roman
- On trees with equal Roman domination and outer-independent Roman domination numbers
- Signed Roman edge domination numbers in graphs
- Signed Roman \(k\)-domination in graphs
- Unique response Roman domination: complexity and algorithms
- Weak signed Roman k-domination in digraphs
- Signed total Italian domination in digraphs
- Roman domination number of signed graphs
- Weak signed Roman k-domatic number of a graph
- Roman domination in signed graphs
- On \(d\)-stable locally checkable problems parameterized by mim-width
- On the signed strong total Roman domination number of graphs
- Outer-independent signed Roman domination function in graphs
- More results on the signed double Roman domination number of graphs
- More results on the signed double Roman k-domination in graphs
- The signed (total) Roman domination problem on some classes of planar graphs -- convex polytopes
- Majority double Roman domination in graphs
- On double Roman domination problem for several graph classes
- Signed total Roman domination and domatic numbers in graphs
- Signed total double Roman dominating functions in graphs
- The Roman domatic problem in graphs and digraphs. II: A survey
- The signed Roman domination number of ladder graphs and their complements
- Signed double Roman k-domination in digraphs
- Weak signed Roman k-domatic number of a digraph
- Weak signed double Roman domination in graphs
- Weak signed total Italian domination in digraphs
This page was built for publication: Signed Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444148)
