4 papers
On -limited and -domination in cubic graphs
Goran Radić, Aleksandra Tepeh
A dominating set of a graph is called -limited if every vertex of has at most one neighbor outside , while a -dominating set is a dominating set in which every…
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, t…
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 among all -limited dominating sets of a graph …
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…