Loading...
Loading...

Go to the content (press return)

The graph distance game and some graph operations

Author
Cáceres, J.; Puertas, M. Luz; Hernando, M.; Mora, M.; Pelayo, I. M.
Type of activity
Journal article
Journal
Electronic notes in discrete mathematics
Date of publication
2014-09-02
Volume
46
First page
153
Last page
159
DOI
https://doi.org/10.1016/j.endm.2014.08.021 Open in new window
Repository
http://hdl.handle.net/2117/24526 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S1571065314000225# Open in new window
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
Citation
Cáceres, J. [et al.]. The graph distance game and some graph operations. "Electronic notes in discrete mathematics", 02 Setembre 2014, vol. 46, p. 153-159.
Keywords
Distance game, graph operations
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Participants