Pages that link to "Item:Q3583327"

The following pages link to Extremal Problems for Roman Domination (Q3583327):

Displaying 50 items.

• Averaging 2-rainbow domination and Roman domination (Q266967) (← links)
• Computing Roman domatic number of graphs (Q284340) (← links)
• Double Roman domination (Q335328) (← links)
• Edge Roman domination on graphs (Q343714) (← links)
• The roman \(k\)-domatic number of a graph (Q353534) (← links)
• Roman domination on strongly chordal graphs (Q385486) (← links)
• On the roman domination in the lexicographic product of graphs (Q442220) (← links)
• Signed Roman edge \(k\)-domination in graphs (Q505464) (← links)
• Italian domination in trees (Q516889) (← links)
• \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
• Upper bounds on Roman domination numbers of graphs (Q764908) (← links)
• Perfect double Roman domination of trees (Q777364) (← links)
• Roman domination problem with uncertain positioning and deployment costs (Q781325) (← links)
• A note on Roman domination in graphs (Q856892) (← links)
• Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
• The roman domatic number of a graph (Q990809) (← links)
• On the Roman domination number of a graph (Q1025980) (← links)
• A note on Roman domination of digraphs (Q1630917) (← links)
• Some progress on the double Roman domination in graphs (Q1630922) (← links)
• Extremal problems on weak Roman domination number (Q1653022) (← links)
• Perfect Roman domination in trees (Q1693150) (← links)
• Weak \(\{2\}\)-domination number of Cartesian products of cycles (Q1698059) (← links)
• Nordhaus-Gaddum bounds for total Roman domination (Q1698063) (← links)
• On the global Roman domination number in graphs (Q1708687) (← links)
• On the co-Roman domination in graphs (Q1717198) (← links)
• The Roman \(\{2 \}\)-domatic number of graphs (Q1732117) (← links)
• A characterization of double Roman trees (Q1735679) (← links)
• Perfect Italian domination in trees (Q1741510) (← links)
• Double Roman domination number (Q1752604) (← links)
• A characterization of trees based on edge-deletion and its applications for domination-type invariants (Q2028069) (← links)
• A continuous generalization of domination-like invariants (Q2045030) (← links)
• Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
• Roman \(\{2\}\)-domination problem in graphs (Q2118251) (← links)
• A note on the bounds of Roman domination numbers (Q2144876) (← links)
• Extremal graphs for a bound on the Roman domination number (Q2175235) (← links)
• On the \(k\)-strong Roman domination problem (Q2197424) (← links)
• Perfect Italian domination on planar and regular graphs (Q2197486) (← links)
• Graphs with large Italian domination number (Q2210211) (← links)
• Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) (Q2239024) (← links)
• Double Roman domination in digraphs (Q2272602) (← links)
• Quasi-total Roman domination in graphs (Q2275312) (← links)
• Unique response Roman domination in graphs (Q2275912) (← links)
• Roman \(\{2\}\)-bondage number of a graph (Q2282478) (← links)
• Approximation algorithm for a generalized Roman domination problem in unit ball graphs (Q2292134) (← links)
• Independent double Roman domination in graphs (Q2304392) (← links)
• Extremal digraphs for an upper bound on the Roman domination number (Q2331577) (← links)
• On perfect Roman domination number in trees: complexity and bounds (Q2331583) (← links)
• On the double Roman domination of graphs (Q2335792) (← links)
• Global Roman domination in trees (Q2354598) (← links)
• Vertex-addition strategy for domination-like invariants (Q2401431) (← links)