In this note the split domination number of the Cartesian product of two paths is considered. Our results are related to [2] where the domination number of Pₘ ☐ Pₙ was studied. The split domination number of P₂ ☐ Pₙ is calculated, and we give good estimates for the split domination number of Pₘ ☐ Pₙ expressed in terms of its domination number.
A dominating set D of G is called a split dominating set of G if the subgraph induced by the subset V(G)-D is disconnected. The cardinality of a minimum split dominating set is called the minimum split domination number of G. Such subset and such number was introduced in [4]. In [2], [3] the authors estimated the domination number of products of graphs. More precisely, they were study products of paths. Inspired by those results we give another estimation of the domination number of the conjunction...
This paper contains a number of estimations of the split domination number and the maximal domination number of a graph with a deleted subset of edges which induces a complete subgraph Kₚ. We discuss noncomplete graphs having or not having hanging vertices. In particular, for p = 2 the edge deleted graphs are considered. The motivation of these problems comes from [2] and [6], where the authors, among other things, gave the lower and upper bounds on irredundance, independence and domination numbers...
Page 1