Sandi Klavzar

activity

20232026

k

-stepwise irregular graphs

1 citations · 3 across the 12 of their papers we have counts for

collaborators

13 papers

math.CO2026★ 1 cited

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…

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 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…

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)|…

cs.SI2025

Burning some myths on privacy properties of social networks against active attacks

Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar +1

This work focuses on showing some arguments addressed to dismantle the extended idea about that social networks completely lacks of privacy properties. We consider the so-called ac…

math.CO2025

Enumerating the number of $k$ -matchings in successively amalgamated graphs

Simon Grad, Sandi Klavžar

In this paper, the transfer matrix technique using the $k$ -matching vector is developed to compute the number of $k$ -matchings in an arbitrary graph which can be constructed by suc…

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 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.CO2024★ 1 cited

Extremal results on $k$ -stepwise irregular graphs

Yaser Alizadeh, Sandi Klavžar, Javaher Langari

For a positive integer $k \geq 1$ , a graph $G$ is $k$ -stepwise irregular ( $k$ -SI graph) if the degrees of every pair of adjacent vertices differ by exactly $k$ . Such graphs are neces…

math.CO2024

Injective colorings of Sierpiński-like graphs and Kneser graphs

Boštjan Brešar, Sandi Klavžar, Babak Samadi +1

Two relationships between the injective chromatic number and, respectively, chromatic number and chromatic index, are proved. They are applied to determine the injective chromatic…

math.CO2024★ 1 cited

On ${1, 2}$ -distance-balancedness of generalized Petersen graphs

Gang Ma, Jianfeng Wang, Sandi Klavžar

A connected graph $G$ of diameter $diam (G) \geq ℓ$ is $ℓ$ -distance-balanced if $∣ W_{x y} ∣ = ∣ W_{y x} ∣$ for every $x, y \in V (G)$ with $d_{G} (x, y) = ℓ$ , where $W_{x y}$ is the…

math.CO2024

On the $Δ$ -edge stability number of graphs

Saieed Akbari, Reza Hosseini Dolatabadi, Mohsen Jamaali +2

The $Δ$ -edge stability number $es_{Δ} (G)$ of a graph $G$ is the minimum number of edges of $G$ whose removal results in a subgraph $H$ with $Δ (H) = Δ (G) - 1$ . Sets whose removal…

math.CO2023

The Sierpiński Domination Number

Michael A. Henning, Sandi Klavžar, Elżbieta Kleszcz +1

Let $G$ and $H$ be graphs and let $f : V (G) \to V (H)$ be a function. The Sierpiński product of $G$ and $H$ with respect to $f$ , denoted by $G \otimes_{f} H$ , is defined…

M-Polynomial of Product Graphs

The vertex visibility number of graphs

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

On the weak k-metric dimension of Hamming graphs

Burning some myths on privacy properties of social networks against active attacks

Enumerating the number of k-matchings in successively amalgamated graphs

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

On decycling and forest numbers of Cartesian products of trees

Extremal results on k-stepwise irregular graphs

Injective colorings of Sierpiński-like graphs and Kneser graphs

On {1,2}-distance-balancedness of generalized Petersen graphs

On the Δ-edge stability number of graphs

The Sierpiński Domination Number

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

Enumerating the number of $k$ -matchings in successively amalgamated graphs

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

Extremal results on $k$ -stepwise irregular graphs

On ${1, 2}$ -distance-balancedness of generalized Petersen graphs

On the $Δ$ -edge stability number of graphs