81 citations · 214 across the 80 of their papers we have counts for
12 papers · 1 filter
On the computational complexity of the Steiner -eccentricity
Xingfu Li, Guihai Yu, Aleksandar Ilić +1
The Steiner -eccentricity of a vertex of a graph is the maximum Steiner distance over all -subsets of which contain . A linear time algorithm for calculati…
On the mutual visibility in Cartesian products and triangle-free graphs
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar
Given a graph and a set , the following concepts have been recently introduced: two elements of are \emph{mutually visible} if there is…
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs
Hongbo Hua, Xinying Hua, Sandi Klavžar +1
The total domination number of a graph is the cardinality of a smallest set such that each vertex of has a neighbor in . The annihilation nu…
The geodesic transversal problem on some networks
Paul Manuel, Bostjan Bresar, Sandi Klavzar
A set S of vertices of a graph G is a geodesic transversal of G if every maximal geodesic of G contains at least one vertex of S. We determine a smallest geodesic transversal in ce…
On the Chromatic Vertex Stability Number of Graphs
Saieed Akbari, Arash Beikmohammadi, Sandi Klavžar +1
The chromatic vertex (resp.\ edge) stability number (resp.\ ) of a graph is the minimum number of vertices (resp.\ edges) whose deletion results…
Global forcing number for maximal matchings in corona products
Sandi Klavžar, Mostafa Tavakoli, Gholamreza Abrishami
A global forcing set for maximal matchings of a graph is a set such that for each pair of maximal matchings an…