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 2021Show all

4 papers · 1 filter

math.CO2021★ 1 cited

Zero forcing number versus general position number in tree-like graphs

Hongbo Hua, Xinying Hua, Sandi Klavžar

Let $Z (G)$ and $gp (G)$ be the zero forcing number and the general position number of a graph $G$ , respectively. Known results imply that $gp (T) \geq Z (T) + 1$ …

math.CO2021

The general position achievement game played on graphs

Sandi Klavžar, Neethu P. K., Ullas Chandran S.

A general position set of a graph $G$ is a set of vertices $S$ in $G$ such that no three vertices from $S$ lie on a common shortest path. In this paper we introduce and study the g…

math.CO2021

A characterization of 4- $χ_{S}$ -vertex-critical graphs for packing sequences with $s_{1} = 1$ and $s_{2} \geq 3$

Sandi Klavžar, Hui Lei, Xiaopan Lian +1

If $S = (s_{1}, s_{2}, \dots)$ is a non-decreasing sequence of positive integers, then the $S$ -packing $k$ -coloring of a graph $G$ is a mapping $c : V (G) \to [k]$ such that if $c(u)=…

math.CO2021★ 2 cited

Some binary products and integer linear programming for computing $k$ -metric dimension of graphs

Sandi Klavžar, Freydoon Rahbarnia, Mostafa Tavakoli

Let $G$ be a connected graph. For an ordered set $S = {v_{1}, \dots, v_{ℓ}} \subseteq V (G)$ , the vector $r_{G} (v ∣ S) = (d_{G} (v_{1}, v), \dots, d_{G} (v_{ℓ}, v))$ is called the metric $S$ -repr…

Zero forcing number versus general position number in tree-like graphs

The general position achievement game played on graphs

A characterization of 4-χS​-vertex-critical graphs for packing sequences with s1​=1 and s2​≥3

Some binary products and integer linear programming for computing k-metric dimension of graphs

A characterization of 4- $χ_{S}$ -vertex-critical graphs for packing sequences with $s_{1} = 1$ and $s_{2} \geq 3$

Some binary products and integer linear programming for computing $k$ -metric dimension of graphs