The graph distance game and some graph operations
Document typeConference report
Rights accessOpen Access
In the graph distance game, two players alternate in constructing a max- imal 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
CitationCáceres, José [et al.]. The graph distance game and some graph operations. A: IX JORNADAS DE MATEMATICA DISCRETA Y ALGORITMICA. "Actas de IX JORNADAS DE MATEMATICA DISCRETA Y ALGORITMICA". Tarragona: 2014, p. 169-174.