Defending the Roman Empire from multiple attacks

被引：53

作者：

Henning, MA ^{[1
]}

机构：

[1] Univ Natal, Sch Math Stat & Informat Technol, ZA-3209 Pietermaritzburg, South Africa

来源：

DISCRETE MATHEMATICS | 2003年 / 271卷 / 1-3期

关键词：

domination number; k-Roman dominating function; forest;

D O I：

10.1016/S0012-365X(03)00040-2

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Motivated by articles by Stewart (Defend the Roman Empire!, Sci. Amer. (December 1999) 136-138) and ReVelle and Rosing (Defendens imperium Romanum:(2) A classical problem in military strategy, Amer. Math. Monthly 107 (7) (2000) 585-594), we explore a strategy of defending the Roman Empire from multiple attacks by stationing as few legions as possible. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：101 / 115

页数：15

共 13 条

[1] DOMINATING SETS IN CHORDAL GRAPHS [J].

BOOTH, KS ;

JOHNSON, JH .

SIAM JOURNAL ON COMPUTING, 1982, 11 (01) :191-199

[2]

Booth KS, 1980, CS8034 U WAT

[3]

COCKAYNE E, 2000, 9 QUADR INT C GRAPH

[4]

COCKAYNE EJ, UNPUB ROMAN DOMINATI

[5]

DEWDNEY AK, 1981, 71 U W ONT

[6]

Dreyer P., 2000, THESIS RUTGERS U NEW

[7]

Gunther G., 1994, C NUMER, V101, P55

[8]

Haynes T. W., 1998, FUNDAMENTALS DOMINAT

[9]

Haynes T. W., 1998, FUNDAMENTALS DOMINAT

[10]

Henning M. A., 2002, Discussiones Mathematicae Graph Theory, V22, P325, DOI 10.7151/dmgt.1178

← 1 2 →