Sandi Klavzar

activity

20242026

collaborators

10 papers

math.CO2026

M-Polynomial of Product Graphs

El-Mehdi Mehiri, Sandi KlavÅ¾ar

The M-polynomial provides a unifying framework for a wide class of degree-based topological indices. Despite its structural importance, general methods for computing the M-polynomi…

math.CO2026

On the variety of general position problems under vertex and edge removal

Jing Tian, Pakanun Dokyeesun, Sandi KlavÅ¾ar

Let $gp_{t} (G)$ , $gp_{o} (G)$ , and $gp_{d} (G)$ be the total, the outer, and the dual general position number of a graph $G$ , respectively. This paper i…

cs.DM2025

The vertex visibility number of graphs

Dhanya Roy, Gabriele Di Stefano, Sandi KlavÅ¾ar +1

If $x \in V (G)$ , then $S \subseteq V (G) ∖ {x}$ is an $x$ -visibility set if for any $y \in S$ there exists a shortest $x, y$ -path avoiding $S$ . The $x$ -visibility number $v_x(G)…

math.CO2025

On decycling and forest numbers of Cartesian products of trees

Ali Ghalavand, Sandi KlavÅ¾ar, Ning Yang

The decycling number $\nabla (G)$ of a graph $G$ is the minimum number of vertices that must be removed to eliminate all cycles in $G$ . The forest number $f (G)$ is the maximum numbe…

math.CO2025

Total $k$ -coalition: bounds, exact values and an application to double coalition

BoÅ¡tjan BreÅ¡ar, Sandi KlavÅ¾ar, Babak Samadi

Let $G=\big{(}V(G),E(G)\big{)}$ be a graph with minimum degree $k$ . A subset $S \subseteq V (G)$ is called a total $k$ -dominating set if every vertex in $G$ has at least $k$ neighbor…

math.CO2025

On the weak $k$ -metric dimension of Hamming graphs

Elena Fernandez, Sandi Klavzar, Dorota Kuziak +2

Given a connected graph $G$ , a set of vertices $X \subset V (G)$ is a weak $k$ -resolving set of $G$ if for each two vertices $y, z \in V (G)$ , the sum of the values $|d_G(y,x)-d_G(z,x)|…

M-Polynomial of Product Graphs

On the variety of general position problems under vertex and edge removal

The vertex visibility number of graphs

On decycling and forest numbers of Cartesian products of trees

Total k-coalition: bounds, exact values and an application to double coalition

On the weak k-metric dimension of Hamming graphs

Total $k$ -coalition: bounds, exact values and an application to double coalition

On the weak $k$ -metric dimension of Hamming graphs