Some results on the maximal safety distance in a graph
Filomat, Tome 37 (2023) no. 15, p. 5123

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

DOI

The work in this paper is motivated by I. Banič and A. Taranenko's recent paper, where they introduced a new notion, the span of a graph. Their goal was to solve the problem of keeping the safety distance while two players are moving through a graph and they presented three different types of graph spans, depending on the movement rules. We observe the same goal, but give a different approach to that problem by directly defining the maximal safety distance for different movement rules two players can take. This allowed us to solve several problems, prove some relations between different graph spans, and calculate the span values for some classes of graphs.
DOI : 10.2298/FIL2315123E
Classification : 05C12, 05C90
Keywords: Safety distance, Graph spans, Strong span, Direct span, Cartesian span
Goran Erceg; Aljoša Šubašić; Tanja Vojković. Some results on the maximal safety distance in a graph. Filomat, Tome 37 (2023) no. 15, p. 5123 . doi: 10.2298/FIL2315123E
@article{10_2298_FIL2315123E,
     author = {Goran Erceg and Aljo\v{s}a \v{S}uba\v{s}i\'c and Tanja Vojkovi\'c},
     title = {Some results on the maximal safety distance in a graph},
     journal = {Filomat},
     pages = {5123 },
     year = {2023},
     volume = {37},
     number = {15},
     doi = {10.2298/FIL2315123E},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.2298/FIL2315123E/}
}
TY  - JOUR
AU  - Goran Erceg
AU  - Aljoša Šubašić
AU  - Tanja Vojković
TI  - Some results on the maximal safety distance in a graph
JO  - Filomat
PY  - 2023
SP  - 5123 
VL  - 37
IS  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.2298/FIL2315123E/
DO  - 10.2298/FIL2315123E
LA  - en
ID  - 10_2298_FIL2315123E
ER  - 
%0 Journal Article
%A Goran Erceg
%A Aljoša Šubašić
%A Tanja Vojković
%T Some results on the maximal safety distance in a graph
%J Filomat
%D 2023
%P 5123 
%V 37
%N 15
%U http://geodesic.mathdoc.fr/articles/10.2298/FIL2315123E/
%R 10.2298/FIL2315123E
%G en
%F 10_2298_FIL2315123E

Cité par Sources :