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

10 papers · 1 filter

math.CO2023

Strong Edge Geodetic Problem on Complete Multipartite Graphs and some Extremal Graphs for the Problem

Sandi Klavžar, Eva Zmazek

A set of vertices $X$ of a graph $G$ is a strong edge geodetic set if to any pair of vertices from $X$ we can assign one (or zero) shortest path between them such that every edge o…

math.CO2023

Resolvability and convexity properties in the Sierpiński product of graphs

Michael A. Henning, Sandi Klavžar, Ismael G. Yero

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…

math.CO2023

Packings in bipartite prisms and hypercubes

Boštjan Brešar, Sandi Klavžar, Douglas F. Rall

The $2$ -packing number $ρ_{2} (G)$ of a graph $G$ is the cardinality of a largest $2$ -packing of $G$ and the open packing number $ρ^{o} (G)$ is the cardinality of a largest open pa…

math.CO2023

Lower General Position Sets in Graphs

Gabriele Di Stefano, Sandi Klavžar, Aditi Krishnakumar +2

A subset $S$ of vertices of a graph $G$ is a \emph{general position set} if no shortest path in $G$ contains three or more vertices of $S$ . In this paper, we generalise a problem o…

math.CO2023

Partial domination in supercubic graphs

Csilla Bujtás andMichael A. Henning, Sandi Klavžar

For some $α$ with $0 < α \leq 1$ , a subset $X$ of vertices in a graph $G$ of order~ $n$ is an $α$ -partial dominating set of $G$ if the set $X$ dominates at least $α \times n$ vertices…

math.CO2023

Graphs whose mixed metric dimension is equal to their order

Ali Ghalavand, Sandi Klavžar, Mostafa Tavakoli

The mixed metric dimension $mdim (G)$ of a graph $G$ is the cardinality of a smallest set of vertices that (metrically) resolves each pair of elements from $V (G) \cup E (G)$ . We…