Pages that link to "Item:Q385486"
From MaRDI portal
The following pages link to Roman domination on strongly chordal graphs (Q385486):
Displaying 50 items.
- Computing Roman domatic number of graphs (Q284340) (← links)
- Edge Roman domination on graphs (Q343714) (← links)
- Perfect double Roman domination of trees (Q777364) (← links)
- Double domination in lexicographic product graphs (Q777395) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- Hardness results of global Roman domination in graphs (Q831760) (← links)
- A note on Roman domination of digraphs (Q1630917) (← links)
- Some progress on the double Roman domination in graphs (Q1630922) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Nordhaus-Gaddum bounds for total Roman domination (Q1698063) (← links)
- On the total Roman domination in trees (Q1717206) (← links)
- Perfect Italian domination in trees (Q1741510) (← links)
- Graphs with large total 2-rainbow domination number (Q1787767) (← links)
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs (Q2045048) (← links)
- Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
- Algorithm and hardness results in double Roman domination of graphs (Q2118874) (← 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)
- Total 2-rainbow domination numbers of trees (Q2227097) (← links)
- Quasi-total Roman domination in graphs (Q2275312) (← links)
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs (Q2307496) (← links)
- Total Roman reinforcement in graphs (Q2312053) (← links)
- Outer-independent total Roman domination in graphs (Q2328098) (← links)
- Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
- On the strong Roman domination number of graphs (Q2403792) (← links)
- On the Roman domination stable graphs (Q2409777) (← links)
- On the differential and Roman domination number of a graph with minimum degree two (Q2410222) (← links)
- On the signed Roman \(k\)-domination: complexity and thin torus graphs (Q2410261) (← 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 graphs: The class ℛUV R (Q2821115) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- Roman Domination in Graphs (Q3384614) (← links)
- Closed formulas for the total Roman domination number of lexicographic product graphs (Q3390051) (← links)
- The Roman domination number of some special classes of graphs - convex polytopes (Q3390794) (← links)
- Independent Roman domination and 2-independence in trees (Q4577859) (← links)
- Mixed Roman domination and 2-independence in trees (Q4583517) (← 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)
- Global double Roman domination in graphs (Q5030493) (← links)
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties (Q5074890) (← links)
- Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs (Q5139714) (← links)
- Roman k-tuple domination number of a graph (Q5164960) (← links)
- (Q5197584) (← links)
- A Nordhaus–Gaddum bound for Roman domination (Q5242827) (← links)
- Global total Roman domination in graphs (Q5370823) (← links)
- Linear programming approach for various domination parameters (Q5859511) (← links)
