43 citations · 93 across the 31 of their papers we have counts for
4 papers · 1 filter
Domination game played on trees and spanning subgraphs
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
The domination game is played on a graph G. Vertices are chosen, one at a time, by two players Dominator and Staller. Each chosen vertex must enlarge the set of vertices of G domin…
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…
Identifying codes of the direct product of two cliques
Douglas F. Rall, Kirsti Wash
An identifying code in a graph is a dominating set that also has the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. It…
On the Cartesian product of non well-covered graphs
Bert L. Hartnell, Douglas F. Rall
A graph is well-covered if every maximal independent set has the same cardinality, namely the vertex independence number. We answer a question of Topp and Volkmann and prove that i…