4 papers · 1 filter
On -limited domination: complexity and Sierpiński graphs
Dragana Božović
A dominating set of a graph is called -limited if every vertex of has at most neighbors outside . The minimum cardinality among all -limited dominating set…
On -limited domination in graphs
Dragana Božović, Gordana Radić, Žana Kovijanić-Vukićević +1
In this work, we introduce and study the notion of -limited domination in graphs, motivated by applications where dominating vertices have bounded capacity and cannot be overloa…
A note on the packing chromatic number of lexicographic products
Dragana Božović, Iztok Peterin
The packing chromatic number of a graph is the smallest integer such that there exists a -vertex coloring of in which any two vertices receiving color a…
Incidence dimension and 2-packing number in graphs
Dragana Bozovic, Aleksander Kelenc, Iztok Peterin +1
Let be a graph. A set of vertices is an incidence generator for if for any two distinct edges there exists a vertex from which is an endpoint of…