Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The graph distance game and some graph operations

Autor
Cáceres, J.; Puertas, M. Luz; Hernando, M.; Mora, M.; Pelayo, I. M.
Tipus d'activitat
Article en revista
Revista
Electronic notes in discrete mathematics
Data de publicació
2014-09-02
Volum
46
Pàgina inicial
153
Pàgina final
159
DOI
https://doi.org/10.1016/j.endm.2014.08.021 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/24526 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S1571065314000225# Obrir en finestra nova
Resum
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
Citació
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.
Paraules clau
Distance game, graph operations
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
DCG - Discrete and Combinatorial Geometry

Participants