1 citations · 1 across the 2 of their papers we have counts for
4 papers
Domination versus independent domination in regular graphs
Martin Knor, Riste Škrekovski, Aleksandra Tepeh
A set of vertices in a graph is a dominating set if every vertex of is in or is adjacent to a vertex in . If, in addition, is an independent set, then is…
Bounding the k-rainbow total domination number
Kerry Ojakian, Riste Skrekovski, Aleksandra Tepeh
Recently the notion of -rainbow total domination was introduced for a graph , motivated by a desire to reduce the problem of computing the total domination number of the gene…
On -rainbow independent domination in graphs
Tadeja Kraner Šumenjak, Douglas F. Rall, Aleksandra Tepeh
In this paper, we define a new domination invariant on a graph , which coincides with the ordinary independent domination number of the generalized prism , called th…
Rainbow domination in the lexicographic product of graphs
Tadeja Kraner Sumenjak, Douglas F. Rall, Aleksandra Tepeh
Let k be a positive integer and let f be a map from V(G) to the set of all subsets of {1,2,3,...,k}. The function f is called a k-rainbow dominating function of G provided that whe…