4 citations · 14 across the 17 of their papers we have counts for
7 papers · 1 filter
On -distance -packing domination number in strong products
Csilla Bujtás, Vesna Iršič Chenoweth, Sandi Klavžar +1
The -distance -packing domination number 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 of is the minimum size of a set of vertices of which is both a -distance dominating set and a -packing. In 1…
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…
Varieties of mutual-visibility and general position on Sierpiński graphs
Dhanya Roy, Sandi Klavžar, Aparna Lakshmanan +1
The variety of mutual-visibility problems contains four members, as does the variety of general position problems. The basic problem is to determine the cardinality of the largest…
Three algorithmic approaches to the general position problem
Zahra Hamed-Labbafian, Narjes Sabeghi, Mostafa Tavakoli +1
If is a graph, then is a general position set if for every two vertices and every shortest -path , it holds that no inner vertex of l…
Criticality for Maker-Breaker domination games with predomination
Csilla Bujtás, Pakanun Dokyeesun, Sandi Klavžar +1
A predominated graph is a pair , where is a graph and the vertices in are considered already dominated. Maker-Breaker domination game critical (MBD cri…
The General Position Problem: A Survey
Ullas Chandran S. V., Sandi Klavžar, James Tuite
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…