Pages that link to "Item:Q1810648"
From MaRDI portal
The following pages link to Defending the Roman Empire---a new strategy (Q1810648):
Displaying 35 items.
- Outer independent Roman dominating functions in graphs (Q3177476) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS (Q3560065) (← links)
- (Q4820838) (← links)
- ON THE ROMAN BONDAGE NUMBER OF A GRAPH (Q4928332) (← links)
- SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS (Q4956381) (← links)
- Bounds on the co-Roman domination number in graphs (Q4985578) (← links)
- Weak Roman subdivision number of graphs (Q5063279) (← links)
- (Q5070078) (← links)
- (Q5076568) (← links)
- Protection of graphs with emphasis on Cartesian product graphs (Q5080300) (← links)
- Algorithmic aspects of outer independent Roman domination in graphs (Q5101892) (← links)
- Graphs whose weak Roman domination number increases by the deletion of any edge (Q5101896) (← links)
- (Q5134323) (← links)
- (Q5197584) (← links)
- Trees with equal Roman {2}-domination number and independent Roman {2}-domination number (Q5242342) (← links)
- A Nordhaus–Gaddum bound for Roman domination (Q5242827) (← links)
- On trees with equal Roman domination and outer-independent Roman domination numbers (Q5242949) (← links)
- Secure vertex cover of a graph (Q5347260) (← links)
- R<scp>OMAN DOMINATION</scp>: a parameterized perspective† (Q5438692) (← links)
- An algorithm to recognize weak roman domination stable trees under vertex deletion (Q5858156) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
- Isolate Roman domination in graphs (Q5866034) (← links)
- An upper bound on the double Roman domination number (Q5895065) (← links)
- Regular graphs with large Italian domatic number (Q6101495) (← links)
- The Outer-Paired Domination of Graphs (Q6114861) (← links)
- (Q6149321) (← links)
- (Q6150933) (← links)
- Algorithmic Aspects of Quasi-Total Roman Domination in Graphs (Q6158956) (← links)
- Roman {2}-domination in Graphs and Graph Products (Q6187741) (← links)
- Algorithmic results for weak Roman domination problem in graphs (Q6633543) (← links)
- Domination-related parameters in middle graphs (Q6637063) (← links)
- Weak double Roman domination (Q6639835) (← links)
- The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)
