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

105 papers

math.CO2026

Edge transmission irregular graphs

Kexiang Xu, Ivan Damnjanović, Uroš Milivojević +1

The transmission of a vertex $v$ in a connected graph $G$ is the sum of distances from $v$ to all vertices in $G$ . A transmission irregular (TI) graph is a connected graph in which…

math.CO2024

General position polynomials

Vesna Iršič, Sandi Klavžar, Gregor Rus +1

A subset of vertices of a graph $G$ is a general position set if no triple of vertices from the set lie on a common shortest path in $G$ . In this paper we introduce the general pos…

math.CO2024

Mutual-visibility problems on graphs of diameter two

Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar +1

The mutual-visibility problem in a graph $G$ asks for the cardinality of a largest set of vertices $S \subseteq V (G)$ so that for any two vertices $x, y \in S$ there is a shortest $x,…

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…