2–5 Jul 2024
Osijek
Europe/Zagreb timezone

Keeping the maximal safety distance in a graph

Not scheduled
20m
Osijek

Osijek

School of Applied Mathematics and Informatics, J. J. Strossmayer University of Osijek, Trg Ljudevita Gaja 6, Osijek Faculty of Economics, J. J. Strossmayer University of Osijek , Trg Ljudevita Gaja 7, Osijek
Talk CDM: Combinatorics and Discrete Mathematics

Speaker

Tanja Vojković (Faculty of Science, University of Split)

Description

In their recent work, I. Banič and A. Taranenko 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. They presented three different types of graph spans, depending on the movement rules and relating them to the strong, direct and Cartesian graph products. We observed the same goal, but gave 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.

Primary authors

Dr Aljoša Šubašić (Faculty of Science, University of Split) Tanja Vojković (Faculty of Science, University of Split)

Presentation materials

There are no materials yet.