81 citations · 214 across the 80 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015
On the structure of dominating graphs
Saeid Alikhani, Davood Fatehi, Sandi Klavžar
The -dominating graph of a graph is defined on the vertex set consisting of dominating sets of with cardinality at most , two such sets being adjacent if the…
math.CO2015
Graphs that are simultaneously efficient open domination and efficient closed domination graphs
Sandi Klavzar, Iztok Peterin, Ismael G. Yero
A graph is an efficient open (resp.\ closed) domination graph if there exists a subset of vertices whose open (resp.\ closed) neighborhoods partition its vertex set. Graphs that ar…
math.CO2015
Complexity of the Game Domination Problem
Boštjan Brešar, Paul Dorbec, Sandi Klavžar +2
The game domination number is a graph invariant that arises from a game, which is related to graph domination in a similar way as the game chromatic number is related to graph colo…