Abstract
A set of vertices in a graph is called dominating if every vertex of is either in or adjacent to a vertex of . The paired domination number of is the minimum size of a dominating set whose induced subgraph admits a perfect matching, and the upper domination number is the maximum size of a minimal dominating set. In this paper, we investigate the sharpness of two multiplicative inequalities for these domination parameters, where the graph product is the direct product . We show that for every positive constant , there exist graphs and of arbitrarily large diameter such that , thus answering a question of Rall as well as two questions of Paulraja and Sampath Kumar. We then study when this inequality holds with , in particular proving that it holds whenever and are trees. Finally, we demonstrate that the inequality , due to Brešar, Klavžar, and Rall, is tight.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.