Pages that link to "Item:Q1028141"
From MaRDI portal
The following pages link to Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number (Q1028141):
Displaying 12 items.
- Computing Roman domatic number of graphs (Q284340) (← links)
- Edge Roman domination on graphs (Q343714) (← links)
- On the roman domination in the lexicographic product of graphs (Q442220) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Bounds on the exponential domination number (Q729783) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Global Roman domination in graphs (Q906445) (← links)
- On the geodetic and geodetic domination numbers of a graph (Q982620) (← links)
- Bounds on the 2-domination number (Q1744236) (← links)
- Constructing dominating sets in circulant graphs (Q1745909) (← links)
- Grundy dominating sequences and zero forcing sets (Q1751247) (← links)
