John Asplund

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph G, called the sub-k-domination number and denoted sub k (G). We show that sub k (G) is a computationally efficient sharp lower bound on the k-domination number of G, and improves on several known lower bounds. We also characterize the sub-k-domination(More)
  • 1