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

4 papers · 1 filter

math.CO2024

On $ℓ$ -distance-balancedness of cubic Cayley graphs of dihedral groups

Gang Ma, Jianfeng Wang, Guang Li +1

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

math.CO2024

Interplay between the local metric dimension and the clique number of a graph

Ali Ghalavand, Sandi Klavžar, Xueliang Li

The local metric dimension $dim_{l}$ in relation to the clique number $ω$ is investigated. It is proved that if $ω (G) \leq n (G) - 3$ , then $dim_{l} (G) \leq n (G) - 3$ and the gra…

math.CO2024

Breaking Symmetry in Graphs by Resolving Sets

Meysam Korivand, Nasrin Soltankhah, Sandi Klavžar

Let $dim (G)$ and $D (G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$ . It is proved that $D (G) \leq dim (G) + 1$ holds for every con…

math.CO2024

Monophonic position sets of Cartesian and lexicographic products of graphs

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

The general position problem in graph theory asks for the number of vertices in a largest set $S$ of vertices of a graph $G$ such that no shortest path of $G$ contains more than tw…

On ℓ-distance-balancedness of cubic Cayley graphs of dihedral groups

Interplay between the local metric dimension and the clique number of a graph

Breaking Symmetry in Graphs by Resolving Sets

Monophonic position sets of Cartesian and lexicographic products of graphs

On $ℓ$ -distance-balancedness of cubic Cayley graphs of dihedral groups