Sandi Klavžar

collaborators

2 papers

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…

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