Sandi Klavžar

collaborators

4 papers

math.CO2026

Domination game and total domination game played on Sierpiński graphs

Tanja Dravec, Daniel P. Johnston, Sandi Klavžar

The game domination numbers $γ_{g}$ and $γ_{g}^{'}$ , and the game total domination numbers $γ_{tg}$ and $γ_{tg}^{'}$ are investigated on Sierpiński graphs $…

math.CO2026

Bounds on the game isolation number and exact values for paths and cycles

Csilla BujtÃ¡s, Tanja Dravec, Michael A. Henning +1

The isolation game is played on a graph $G$ by two players who take turns playing a vertex such that if $X$ is the set of already played vertices, then a vertex can be selected onl…

math.CO2025

Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks

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

Networks are often modeled using graphs, and within this setting we introduce the notion of $k$ -fault-tolerant mutual visibility. Informally, a set of vertices $X \subseteq V (G)$ i…

math.CO2025

The $d$ -distance $p$ -packing domination number: complexity, cycles, and trees

Csilla BujtÃ¡s, Vesna IrÅ¡iÄ Chenoweth, Sandi KlavÅ¾ar +1

A set of vertices $X \subseteq V (G)$ is a $d$ -distance dominating set if for every $u \in V (G) ∖ X$ there exists $x \in X$ such that $d (u, x) \leq d$ , and $X$ is a $p$ -packing if…

Domination game and total domination game played on Sierpiński graphs

Bounds on the game isolation number and exact values for paths and cycles

Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks

The d-distance p-packing domination number: complexity, cycles, and trees

The $d$ -distance $p$ -packing domination number: complexity, cycles, and trees