Abstract
A discussion about defending the Roman Empire from multiple attacks is presented. It is done by stationing as few legions as possible. Graph theoretic models to defend the Roman Empire from single attacks are also studied.
| Original language | English |
|---|---|
| Pages (from-to) | 101-115 |
| Number of pages | 15 |
| Journal | Discrete Mathematics |
| Volume | 271 |
| Issue number | 1-3 |
| DOIs | |
| Publication status | Published - 28 Sept 2003 |
| Externally published | Yes |
Keywords
- Domination number
- Forest
- k-Roman dominating function
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics