The following pages link to Roman domination in graphs. (Q1427467):
Displaying 50 items.
- Roman \(\{2 \}\)-domination (Q266795) (← links)
- Computing Roman domatic number of graphs (Q284340) (← links)
- Roman domination in subgraphs of grids (Q324726) (← links)
- The \(\mathbb{N}_k\)-valued Roman domination and its boundaries (Q324921) (← links)
- Double Roman domination (Q335328) (← links)
- The roman \(k\)-domatic number of a graph (Q353534) (← links)
- Coloring, location and domination of corona graphs (Q372395) (← links)
- Roman domination on strongly chordal graphs (Q385486) (← links)
- Independent protection in graphs (Q400447) (← links)
- On the independent domination number of the generalized Petersen graphs (Q421876) (← links)
- On the roman domination in the lexicographic product of graphs (Q442220) (← links)
- Combinatorics for smaller kernels: the differential of a graph (Q476877) (← links)
- Restricted optimal pebbling and domination in graphs (Q512538) (← links)
- Italian domination in trees (Q516889) (← links)
- On the Roman bondage number of planar graphs (Q659719) (← links)
- On roman, global and restrained domination in graphs (Q659738) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- Upper bounds on Roman domination numbers of graphs (Q764908) (← links)
- Perfect double Roman domination of trees (Q777364) (← links)
- Constructive characterizations concerning weak Roman domination in trees (Q777409) (← links)
- On the Roman domination subdivision number of a graph (Q782761) (← 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 in graphs (Q856892) (← links)
- Global Roman domination in graphs (Q906445) (← links)
- Note on 2-rainbow domination and Roman domination in graphs (Q972956) (← links)
- The roman domatic number of a graph (Q990809) (← links)
- Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
- Roman domination in regular graphs (Q1024464) (← links)
- On the Roman domination number of a graph (Q1025980) (← links)
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number (Q1028141) (← links)
- Secure domination critical graphs (Q1045117) (← links)
- Defending the Roman Empire from multiple attacks (Q1408869) (← links)
- Some progress on the double Roman domination in graphs (Q1630922) (← links)
- Extremal problems on weak Roman domination number (Q1653022) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Mixed Roman domination in graphs (Q1684257) (← links)
- Bounds on the locating Roman domination number in trees (Q1692624) (← links)
- Perfect Roman domination in trees (Q1693150) (← links)
- Independent Roman \(\{2 \}\)-domination in graphs (Q1693166) (← links)
- Weak \(\{2\}\)-domination number of Cartesian products of cycles (Q1698059) (← links)
- Nordhaus-Gaddum bounds for total Roman domination (Q1698063) (← links)
- Some improved inequalities related to Vizing's conjecture (Q1708275) (← links)
- On the global Roman domination number in graphs (Q1708687) (← links)
- On the co-Roman domination in graphs (Q1717198) (← links)
- On the total Roman domination in trees (Q1717206) (← links)
- Signed double Roman domination in graphs (Q1730213) (← links)
- The Roman \(\{2 \}\)-domatic number of graphs (Q1732117) (← links)
- A characterization of double Roman trees (Q1735679) (← links)
