S. Klavžar

collaborators

3 papers

math.CO2025

The geodesic cover problem for butterfly networks

Paul Manuel, Sandi Klavzar, R. Prabha +1

A geodesic cover, also known as an isometric path cover, of a graph is a set of geodesics which cover the vertex set of the graph. An edge geodesic cover of a graph is a set of geo…

math.CO2024

Traversing a graph in general position

Sandi KlavÅ¾ar, Aditi Krishnakumar, James Tuite +1

Let $G$ be a graph. Assume that to each vertex of a set of vertices $S \subseteq V (G)$ a robot is assigned. At each stage one robot can move to a neighbouring vertex. Then $S$ is a…

math.CO2024

Mutual-visibility in strong products of graphs via total mutual-visibility

Serafino Cicerone, Gabriele Di Stefano, Sandi KlavÅ¾ar +1

Let $G$ be a graph and $X \subseteq V (G)$ . Then $X$ is a mutual-visibility set if each pair of vertices from $X$ is connected by a geodesic with no internal vertex in $X$ . The mutua…