Search Game on the Union of N Identical Graphs Joined at One or Two Points
Yugoslav journal of operations research, Tome 3 (1993) no. 1, p. 3
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
We give the conditions under which the value of strategy h on graph which consists of N identical graphs joined at one or two points, where the hider uses the same strategy h/n on every single graph, is n times greater or equal than the value of strategy n on one graph. This gives the possibility that using the value of the game on one graph, we can obtain the value on the union of more identical graphs.
Classification :
90D05
Keywords: search game, graph, zero sum
Keywords: search game, graph, zero sum
@article{YJOR_1993_3_1_a0,
author = {Ljiljana Pavlovi\'c},
title = {Search {Game} on the {Union} of {N} {Identical} {Graphs} {Joined} at {One} or {Two} {Points}},
journal = {Yugoslav journal of operations research},
pages = {3 },
year = {1993},
volume = {3},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_1993_3_1_a0/}
}
Ljiljana Pavlović. Search Game on the Union of N Identical Graphs Joined at One or Two Points. Yugoslav journal of operations research, Tome 3 (1993) no. 1, p. 3 . http://geodesic.mathdoc.fr/item/YJOR_1993_3_1_a0/