Sandi Klavvzar

activity

20172026

most citedCharacterization of general position sets and its applications to cographs and bipartite graphs

3 citations · 8 across the 22 of their papers we have counts for

collaborators

Showing 2025Show all

6 papers · 1 filter

math.CO2025

Maker-Breaker resolving game played on lexicographic products of graphs

Savitha K S, Sandi Klavžar, Tijo James

In the Maker-Breaker resolving game, two players named Resolver and Spoiler alternately select unplayed vertices of a given graph $G$ . The aim of Resolver is to select all the vert…

math.CO2025

Maker-Breaker total domination number

Athira Divakaran, Tijo James, Sandi Klavžar +1

The Maker-Breaker total domination number, $γ_{MBT} (G)$ , of a graph $G$ is introduced as the minimum number of moves of Dominator to win the Maker-Breaker total domination game…

math.CO2025

Intertwining local (adjacency) metric dimension with the clique number of a graph

Ali Ghalavand, Sandi Klavžar, Xueliang Li

Let $G$ be a simple connected graph with order $n (G)$ , local metric dimension $dim_{l} (G)$ , local adjacency metric dimension $dim_{A, l} (G)$ , and clique number $ω (G)$ ,…

math.CO2025

On Sierpiński packing chromatic number and recognition of Sierpiński products

Přemysl Holub, Sandi Klavžar

The Sierpiński product $G \otimes_{f} H$ of graphs $G$ and $H$ with respect to a function $f : V (G) \to V (H)$ has the vertex set $V (G) \times V (H)$ . For every $g \in V (G)$ …

math.CO2025

On the local metric dimension of $K_{4}$ -free graphs

Ali Ghalavand, Sandi Klavžar, Xueliang Li

Let $G$ be a graph of order $n (G)$ , local metric dimension $dim_{l} (G)$ , and clique number $ω (G)$ . It has been conjectured that if $n (G) \geq ω (G) + 1 \geq 4$ , then $ \dim_l…

math.CO2025

S-packing chromatic critical graphs

Gülnaz Boruzanlı Ekinci, Csilla Bujtás, Didem Gözüpek +1

For a non-decreasing sequence of positive integers $S = (s_{1}, s_{2}, \dots)$ , the $S$ -packing chromatic number of a graph $G$ is denoted by $χ_{S} (G)$ . In this paper, $χ_{S}$ -critical graph…

Maker-Breaker resolving game played on lexicographic products of graphs

Maker-Breaker total domination number

Intertwining local (adjacency) metric dimension with the clique number of a graph

On Sierpiński packing chromatic number and recognition of Sierpiński products

On the local metric dimension of K4​-free graphs

S-packing chromatic critical graphs

On the local metric dimension of $K_{4}$ -free graphs