Extremal Problems for Roman Domination
From MaRDI portal
Publication:3583327
DOI10.1137/070699688zbMath1207.05135OpenAlexW2019578481WikidataQ106158476 ScholiaQ106158476MaRDI QIDQ3583327
Douglas B. West, Bill Kinnersley, Erin Wolf Chambers, Noah Prince
Publication date: 27 August 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.imsa.edu/cgi/viewcontent.cgi?article=1002&context=math_pr
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (85)
A note on the Roman domatic number of a digraph ⋮ Averaging 2-rainbow domination and Roman domination ⋮ Integer linear programming formulations for double roman domination problem ⋮ Computing Roman domatic number of graphs ⋮ A note on Roman domination of digraphs ⋮ Some progress on the double Roman domination in graphs ⋮ Lower and upper bounds on independent double Roman domination in trees ⋮ A note on the bounds of Roman domination numbers ⋮ Double Roman domination ⋮ Extremal problems on weak Roman domination number ⋮ Relations between the Roman k-domination and Roman domination numbers in graphs ⋮ Edge Roman domination on graphs ⋮ The roman \(k\)-domatic number of a graph ⋮ Vertex-addition strategy for domination-like invariants ⋮ On the strong Roman domination number of graphs ⋮ On the total and strong version for Roman dominating functions in graphs ⋮ Extremal graphs for a bound on the Roman domination number ⋮ On the Roman domination stable graphs ⋮ On the differential and Roman domination number of a graph with minimum degree two ⋮ Roman domination on strongly chordal graphs ⋮ Roman domination in direct product graphs and rooted product graphs ⋮ Exact algorithms for weak Roman domination ⋮ Minimal Roman dominating functions: extensions and enumeration ⋮ Total Roman domination on the digraphs ⋮ Total Roman domination in the lexicographic product of graphs ⋮ Perfect Roman domination in trees ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ On the \(k\)-strong Roman domination problem ⋮ Perfect Italian domination on planar and regular graphs ⋮ Weak \(\{2\}\)-domination number of Cartesian products of cycles ⋮ Nordhaus-Gaddum bounds for total Roman domination ⋮ On the roman domination in the lexicographic product of graphs ⋮ On the global Roman domination number in graphs ⋮ Graphs with large Italian domination number ⋮ Unnamed Item ⋮ Independent double Roman domination in graphs ⋮ Signed Roman domination in graphs ⋮ Unnamed Item ⋮ On the co-Roman domination in graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ The Roman \(\{2 \}\)-domatic number of graphs ⋮ A characterization of double Roman trees ⋮ Perfect Italian domination in trees ⋮ Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) ⋮ Signed Roman edge \(k\)-domination in graphs ⋮ Perfect roman domination in regular graphs ⋮ Italian domination in trees ⋮ Double Roman domination number ⋮ On the Zagreb indices of graphs with given Roman domination number ⋮ On maximal Roman domination in graphs ⋮ ON THE ROMAN BONDAGE NUMBER OF A GRAPH ⋮ Double Roman domination in digraphs ⋮ Quasi-total Roman domination in graphs ⋮ Unique response Roman domination in graphs ⋮ The roman domatic number of a graph ⋮ A characterization of trees based on edge-deletion and its applications for domination-type invariants ⋮ Roman \(\{2\}\)-bondage number of a graph ⋮ Critical graphs with Roman domination number four ⋮ Roman domination in oriented trees ⋮ Approximation algorithm for a generalized Roman domination problem in unit ball graphs ⋮ A continuous generalization of domination-like invariants ⋮ The signed Roman domination number of two classes graphs ⋮ Roman Domination in Graphs ⋮ Independent double Roman domination in graphs ⋮ Roman domination in graphs: The class ℛUV R ⋮ The Roman domination number of some special classes of graphs - convex polytopes ⋮ Double Roman domination and domatic numbers of graphs ⋮ On the Roman domination number of a graph ⋮ Roman domination excellent graphs: trees ⋮ Upper bounds on Roman domination numbers of graphs ⋮ Total Roman domatic number of a graph ⋮ Bounds on the co-Roman domination number in graphs ⋮ Total Roman domination in digraphs ⋮ Perfect double Roman domination of trees ⋮ Trees with equal Roman {2}-domination number and independent Roman {2}-domination number ⋮ A Nordhaus–Gaddum bound for Roman domination ⋮ Nearly tight approximation algorithm for (connected) Roman dominating set ⋮ Roman domination problem with uncertain positioning and deployment costs ⋮ On roman domination number of functigraph and its complement ⋮ Extremal digraphs for an upper bound on the Roman domination number ⋮ On perfect Roman domination number in trees: complexity and bounds ⋮ On the double Roman domination of graphs ⋮ INVERSE ROMAN DOMINATION IN GRAPHS ⋮ Global Roman domination in trees ⋮ Roman \(\{2\}\)-domination problem in graphs
This page was built for publication: Extremal Problems for Roman Domination
