Showing 2026Show all
2 papers · 1 filter
math.CO2026
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…
math.CO2026
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…