The following pages link to Total Roman domination in graphs (Q5279897):
Displaying 48 items.
- Double domination in lexicographic product graphs (Q777395) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- Bounds on the locating Roman domination number in trees (Q1692624) (← links)
- Nordhaus-Gaddum bounds for total Roman domination (Q1698063) (← links)
- On the co-Roman domination in graphs (Q1717198) (← links)
- On the total Roman domination in trees (Q1717206) (← links)
- A characterization of double Roman trees (Q1735679) (← links)
- Double Roman domination number (Q1752604) (← links)
- Graphs with large total 2-rainbow domination number (Q1787767) (← links)
- Reinforcement number of a graph with respect to half-domination (Q2035727) (← links)
- Relating the outer-independent total Roman domination number with some classical parameters of graphs (Q2141037) (← links)
- The Roman domatic problem in graphs and digraphs: a survey (Q2151218) (← links)
- On the \(k\)-strong Roman domination problem (Q2197424) (← links)
- Total 2-rainbow domination numbers of trees (Q2227097) (← links)
- Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) (Q2239024) (← links)
- Quasi-total Roman domination in graphs (Q2275312) (← links)
- Total Roman domination edge-critical graphs (Q2292609) (← links)
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs (Q2307496) (← links)
- Total Roman reinforcement in graphs (Q2312053) (← links)
- Weakly connected Roman domination in graphs (Q2322879) (← links)
- Outer-independent total Roman domination in graphs (Q2328098) (← links)
- On perfect Roman domination number in trees: complexity and bounds (Q2331583) (← links)
- Total Roman domination in the lexicographic product of graphs (Q2420413) (← links)
- On the total and strong version for Roman dominating functions in graphs (Q2662879) (← links)
- Roman domination in direct product graphs and rooted product graphs (Q2671126) (← links)
- Relating the total \(\{2\}\)-domination number with the total domination number of graphs (Q2700617) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- Closed formulas for the total Roman domination number of lexicographic product graphs (Q3390051) (← links)
- Total Roman domination subdivision number in graphs (Q4957524) (← links)
- Total Roman domination for proper interval graphs (Q4958006) (← links)
- Total Roman domatic number of a graph (Q4985437) (← links)
- Total Roman domination in digraphs (Q4986528) (← links)
- Total Roman {2}-domination in graphs (Q4986532) (← links)
- A matheuristic approach for solving the 2-connected dominating set problem (Q4989008) (← links)
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties (Q5074890) (← links)
- Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs (Q5075513) (← links)
- Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs (Q5139714) (← links)
- (Q5205520) (← links)
- Total double Roman domination in graphs (Q5212897) (← links)
- Global total Roman domination in graphs (Q5370823) (← links)
- The double Roman domination number of generalized Sierpiński graphs (Q5858154) (← links)
- On the total Roman domination stability in graphs (Q5861706) (← links)
- On the outer independent total double Roman domination in graphs (Q6042155) (← links)
- Total Roman domination on the digraphs (Q6049701) (← links)
- (Q6097712) (← links)
- A Note on Roman $k$-tuple domination number (Q6101496) (← links)
- Quasi-total Roman reinforcement in graphs (Q6110872) (← links)
- (Q6149330) (← links)