On the Roman domination number of a graph
From MaRDI portal
Publication:1025980
DOI10.1016/J.DISC.2008.09.043zbMATH Open1191.05071OpenAlexW2028111792MaRDI QIDQ1025980FDOQ1025980
Authors: Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmood Sheikholeslami 
Publication date: 23 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.043
Recommendations
Cites Work
Cited In (71)
- Maximum second Zagreb index of trees with given Roman domination number
- Complexity issues of perfect Roman domination in graphs
- Isolate Roman domination in graphs
- Minimal Roman dominating functions: extensions and enumeration
- Independent Roman \(\{3\}\)-domination
- Graphs with small or large Roman {3}-domination number
- An \(iP_2\) extended star graph and its harmonious chromatic number
- On Roman domination number of functigraph and its complement
- Lower and upper bounds on independent double Roman domination in trees
- Minimal Roman dominating functions: extensions and enumeration
- Title not available (Why is that?)
- Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles
- Algorithmic aspects of total Roman \(\{3\}\)-domination in graphs
- Upper bounds on Roman domination numbers of graphs
- Total Roman domination in the lexicographic product of graphs
- Algorithmic aspects of total Roman and total double Roman domination in graphs
- Global Roman domination in graphs
- Total Roman domatic number of a graph
- The differential and the roman domination number of a graph
- Computing Roman domatic number of graphs
- Roman domination on 2-connected graphs
- Note on 2-rainbow domination and Roman domination in graphs
- On the global Roman domination number in graphs
- Properties of double Roman domination on cardinal products of graphs
- Trees with equal Roman \{2\}-domination number and independent Roman \{2\}-domination number
- On the differential and Roman domination number of a graph with minimum degree two
- Algorithmic aspects of Roman domination in graphs
- Title not available (Why is that?)
- Roman domination in regular graphs
- Independent Roman domination and 2-independence in trees
- Extremal problems for roman domination
- Relating the outer-independent total Roman domination number with some classical parameters of graphs
- A note on the bounds of Roman domination numbers
- Title not available (Why is that?)
- Global double Roman domination in graphs
- A Nordhaus-Gaddum bound for Roman domination
- Connected graphs with maximal Roman domination number one less than their order.
- Total Roman reinforcement in graphs
- Title not available (Why is that?)
- The distance Roman domatic number of a graph
- Algorithmic complexity of weakly connected Roman domination in graphs
- Complexity aspects of variants of independent Roman domination in graphs
- Algorithmic Aspects of Quasi-Total Roman Domination in Graphs
- On the Roman domination subdivision number of a graph
- The Roman domination number of some special classes of graphs - convex polytopes
- Extremal graphs for a bound on the Roman domination number
- Constructive characterizations concerning weak Roman domination in trees
- Perfect double Roman domination of trees
- Fractional Roman domination
- Bounds on the co-Roman domination number in graphs
- Extremal digraphs for an upper bound on the Roman domination number
- Mixed Roman domination and 2-independence in trees
- Bounds on Roman domination numbers of graphs
- Nordhaus-Gaddum bounds for total Roman domination
- Weak \(\{2\}\)-domination number of Cartesian products of cycles
- On the roman domination number of generalized Sierpiński graphs
- Roman domination in odd and even graphs
- Restrained Roman domination in graphs
- Roman domination in graphs
- On the \(k\)-strong Roman domination problem
- A characterization of trees with equal Roman 2-domination and Roman domination numbers
- On the strong Roman domination number of graphs
- Exact algorithms for weak Roman domination
- Algorithmic aspects of outer independent Roman domination in graphs
- Critical graphs with Roman domination number four
- On the Roman bondage number of a graph
- Roman domination in direct product graphs and rooted product graphs
- Independent double Roman domination in graphs
- Independent double Roman domination in graphs
- A note on the Roman domatic number of a digraph
- On the co-Roman domination in graphs
This page was built for publication: On the Roman domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025980)
