3 papers
math.CO2026
On externally supported independence number of graphs
Dragana BožoviÄ, Iztok Peterin, Adriana Roux +1
We introduce the \emph{externally supported independence number} of a graph as the maximum cardinality of an independent set with an additional condition,…
math.CO2026
On -limited domination: complexity and Cartesian products
Aleksandra Tepeh
A dominating set is called -limited if every vertex in the set has at most neighbors outside it. The minimum cardinality of a -limited dominating set is the -limited d…
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…