4 citations · 4 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…
cs.DM2015
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
Boris Brimkov, Illya V. Hicks
A generalized vertex join of a graph is obtained by joining an arbitrary multiset of its vertices to a new vertex. We present a low-order polynomial time algorithm for finding the…