S. Klavžar

activity

20092026

most citedM-Polynomial and Degree-Based Topological Indices

81 citations · 214 across the 80 of their papers we have counts for

collaborators

Showing 2019 · math.COShow all

12 papers · 2 filters

math.CO2019★ 10 cited

Comparison of Wiener index and Zagreb eccentricity indices

Kexiang Xu, Kinkar Chandra Das, Sandi Klavžar +1

The first and the second Zagreb eccentricity index of a graph $G$ are defined as $E_{1} (G) = \sum_{v \in V (G)} ε_{G} (v)^{2}$ and $E_2(G)=\sum_{uv\in E(G)}\varepsilon_{G}(u)\var…

math.CO2019

Z-domination game

Csilla Bujtás, Vesna Iršič, Sandi Klavžar

The Z-domination game is a variant of the domination game in which each newly selected vertex $u$ in the game must have a not yet dominated neighbor, but after the move all vertice…

math.CO2019

Perfect graphs for domination games

Csilla Bujtás, Vesna Iršič, Sandi Klavžar

Let $γ_{g} (G)$ and $γ_{t g} (G)$ be the game domination number and the total game domination number of a graph $G$ , respectively. Then $G$ is $γ_{g}$ -perfect (resp. $γ_{t g}$ -perfect), if…

math.CO2019

On general position sets in Cartesian products

Sandi Klavžar, Balázs Patkós, Gregor Rus +1

The general position number $gp (G)$ of a connected graph $G$ is the cardinality of a largest set $S$ of vertices such that no three distinct vertices from $S$ lie on a common…

math.CO2019

The general position problem and strong resolving graph

Sandi Klavzar, Ismael G. Yero

The general position number $gp (G)$ of a connected graph $G$ is the cardinality of a largest set $S$ of vertices such that no three pairwise distinct vertices from $S$ lie on…

math.CO2019★ 2 cited

On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs

Sandi Klavžar, Kolja Knauer, Tilen Marc

It was recently pointed out that certain SiO $_{2}$ layer structures and SiO $_{2}$ nanotubes can be described as full subdivisions aka subdivision graphs of partial cubes. A key tool fo…

math.CO2019

Critical graphs for the chromatic edge-stability number

Boštjan Brešar, Sandi Klavžar, Nazanin Movarraei

The chromatic edge-stability number $es_{χ} (G)$ of a graph $G$ is the minimum number of edges whose removal results in a spanning subgraph $G^{'}$ with $χ (G^{'}) = χ (G) - 1$ . Edge-stabil…

math.CO2019

Comparing Wiener complexity with eccentric complexity

Kexiang Xu, Aleksandar Ilić, Vesna Iršič +2

The transmission of a vertex $v$ of a graph $G$ is the sum of distances from $v$ to all the other vertices in $G$ . The Wiener complexity of $G$ is the number of different transmiss…

math.CO2019

The annihilation number does not bound the 2-domination number from the above

Jun Yue, Shizhen Zhang, Yiping Zhu +2

The $2$ -domination number $γ_{2} (G)$ of a graph $G$ is the minimum cardinality of a set $S \subseteq V (G)$ such that every vertex from $V (G) ∖ S$ is adjacent to at least two ve…

math.CO2019

The general position problem on Kneser graphs and on some graph operations

Modjtaba Ghorbani, Sandi Klavžar, Hamid Reza Maimani +3

A vertex subset $S$ of a graph $G$ is a general position set of $G$ if no vertex of $S$ lies on a geodesic between two other vertices of $S$ . The cardinality of a largest general p…

math.CO2019

Local metric dimension of graphs: generalized hierarchical products and some applications

Sandi Klavžar, Mostafa Tavakoli

Let $G$ be a graph and $S \subseteq V (G)$ . If every two adjacent vertices of $G$ have different metric $S$ -representations, then $S$ is a local metric generator for $G$ . A local met…

math.CO2019

Maker-Breaker total domination game

Valentin Gledel, Michael A. Henning, Vesna Iršič +1

Maker-Breaker total domination game in graphs is introduced as a natural counterpart to the Maker-Breaker domination game recently studied by Duchêne, Gledel, Parreau, and Renault.…