2 citations · 4 across the 4 of their papers we have counts for
7 papers
Extremal results on stepwise transmission irregular graphs
Yaser Alizadeh, Sandi Klavžar
The transmission of a vertex of a connected graph is the sum of distances between and all other vertices in . is a stepwise transmission irregula…
Some binary products and integer linear programming for computing -metric dimension of graphs
Sandi Klavžar, Freydoon Rahbarnia, Mostafa Tavakoli
Let be a connected graph. For an ordered set , the vector is called the metric -repr…
Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
Anja Kišek, Sandi Klavžar
Jha, Pradhan, and Banerjee devised a linear algorithm to compute the secure domination number of a cograph. Here it is shown that their Lemma~2, which is crucial for the computatio…
On the general position number of complementary prisms
Neethu P. K., Ullas Chandran S. V., Manoj Changat +1
The general position number of a graph is the cardinality of a largest set of vertices such that no element of lies on a geodesic between two other elemen…
Characterization of general position sets and its applications to cographs and bipartite graphs
Bijo S. Anand, Ullas Chandran S. V., Manoj Changat +2
A vertex subset of a graph is a general position set of if no vertex of lies on a geodesic between two other vertices of . The cardinality of a largest general p…
Graph theory general position problem
Paul Manuel, Sandi Klavžar
The classical no-three-in-line problem is to find the maximum number of points that can be placed in the grid so that no three points lie on a line. Given a set of…