10 citations · 14 across the 2 of their papers we have counts for
2 papers
cs.DM2016★ 4 cited
The sub--domination number of a graph with applications to -domination
David Amos, John Asplund, Boris Brimkov +1
In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph , called the sub--domination number and denoted . We show tha…
math.CO2014★ 10 cited
Upper bounds on the k-forcing number of a graph
David Amos, Yair Caro, Randy Davila +1
Given a simple undirected graph and a positive integer , the -forcing number of , denoted , is the minimum number of vertices that need to be initially colored…