13 papers
Computing fault-tolerant metric dimension of graphs using their primary subgraphs
S. Prabhu, Sandi Klavžar, K. Bharani Dharan +1
The metric dimension of a graph is the cardinality of a minimum resolving set, which is the set of vertices such that the distance representations of every vertex with respect to t…
Improved Lower Bounds on the General Reduced Second Zagreb Index of Trees and Unicyclic Graphs
Nasrin Dehgardi, Sandi Klavžar, Mahdieh Azari
For a simple graph and a real number , the general reduced second Zagreb index is defined by the formula A…
The General Position Problem: A Survey
Ullas Chandran S. V., Sandi Klavžar, Sandi Klavžar +1
Inspired by a chessboard puzzle of Dudeney, the general position problem in graph theory asks for a largest set of vertices in a graph such that no three elements of lie on…
Moving through Cartesian products, coronas and joins in general position
Sandi Klavžar, Aditi Krishnakumar, Dorota Kuziak +3
The general position problem asks for large sets of vertices such that no three vertices of the set lie on a common shortest path. Recently a dynamic version of this problem was de…
On -distance -packing domination number in strong products
Csilla Bujtás, Vesna IrÅ¡iÄ Chenoweth, Sandi Klavžar +1
The -distance -packing domination number $γ_d^p(G)$ of a graph is the cardinality of a smallest set of vertices of which is both a -distance dominating set and a…
Revisiting -distance (independent) domination in trees and in bipartite graphs
Csilla Bujtás, Vesna IrÅ¡iÄ Chenoweth, Sandi Klavžar +1
The -distance -packing domination number $γ_d^p(G)$ of is the minimum size of a set of vertices of which is both a -distance dominating set and a -packing. In…