Pages that link to "Item:Q1024464"
From MaRDI portal
The following pages link to Roman domination in regular graphs (Q1024464):
Displaying 33 items.
- Computing Roman domatic number of graphs (Q284340) (← links)
- Roman domination in subgraphs of grids (Q324726) (← links)
- On the roman domination in the lexicographic product of graphs (Q442220) (← links)
- Roman domination number of the Cartesian products of paths and cycles (Q456341) (← links)
- Global Roman domination in graphs (Q906445) (← links)
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\) (Q1026161) (← links)
- Roman domination in graphs. (Q1427467) (← links)
- A note on Roman domination of digraphs (Q1630917) (← links)
- A continuous generalization of domination-like invariants (Q2045030) (← links)
- Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
- On the \(k\)-strong Roman domination problem (Q2197424) (← links)
- Quasi-total Roman domination in graphs (Q2275312) (← links)
- Co-Roman domination in graphs (Q2344075) (← links)
- Roman domination dot-critical graphs (Q2376108) (← links)
- Vertex-addition strategy for domination-like invariants (Q2401431) (← links)
- On the strong Roman domination number of graphs (Q2403792) (← links)
- Weak Roman domination in graphs (Q3171420) (← links)
- Roman Domination in Graphs (Q3384614) (← links)
- The Roman domination number of some special classes of graphs - convex polytopes (Q3390794) (← links)
- ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS (Q3560065) (← links)
- (Q4595224) (← links)
- (Q4901046) (← links)
- The geodetic domination number of comb product graphs (Q4958003) (← links)
- Total Roman domination in digraphs (Q4986528) (← links)
- (Q4996672) (← links)
- On the roman domination number of generalized Sierpiński graphs (Q5023115) (← links)
- (Q5064720) (← links)
- (Q5134323) (← links)
- Perfect roman domination in regular graphs (Q5155702) (← links)
- (Q5866362) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6043174) (← links)
- Roman domination and independent Roman domination on graphs with maximum degree three (Q6124437) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)