| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651846 | Electronic Notes in Discrete Mathematics | 2014 | 7 Pages |
Abstract
In the graph distance game, two players alternate in constructing a maximal path. The objective function is the distance between the two endpoints of the path, which one player tries to maximize and the other tries to minimize. In this paper we examine the distance game for various graph operations: the join, the corona and the lexicographic product of graphs. We provide general bounds and exact results for special graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
