Pages that link to "Item:Q856892"
From MaRDI portal
The following pages link to A note on Roman domination in graphs (Q856892):
Displaying 14 items.
- Computing Roman domatic number of graphs (Q284340) (← links)
- Roman domination on strongly chordal graphs (Q385486) (← links)
- Upper bounds on Roman domination numbers of graphs (Q764908) (← links)
- Global Roman domination in graphs (Q906445) (← links)
- Note on 2-rainbow domination and Roman domination in graphs (Q972956) (← links)
- A note on Roman domination of digraphs (Q1630917) (← links)
- Nordhaus-Gaddum bounds for total Roman domination (Q1698063) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- Roman Domination in Graphs (Q3384614) (← links)
- The Roman domination number of some special classes of graphs - convex polytopes (Q3390794) (← links)
- ON THE ROMAN BONDAGE NUMBER OF A GRAPH (Q4928332) (← links)
- (Q5134323) (← links)
- Total Roman domination on the digraphs (Q6049701) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)
