Quaestiones Mathematicae

The AJOL site is currently undergoing a major upgrade, and there will temporarily be some restrictions to the available functionality.
-- Users will not be able to register or log in during this period.
-- Full text (PDF) downloads of Open Access journal articles will be available as always.
-- Full text (PDF) downloads of subscription based journal articles will NOT be available
We apologise for any inconvenience caused. Please check back soon, as we will revert to usual policy as soon as possible.

DOWNLOAD FULL TEXT Open Access  DOWNLOAD FULL TEXT Subscription or Fee Access

Domination versus disjunctive domination in graphs

Michael A Henning, Sinclair A Marcon


A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacent to a vertex of S. The domination number of G is the minimum cardinality of a dominating set of G. For a positive integer b, a set S of vertices in a graph G is a b-disjunctive dominating set in G if every vertex v not in S is adjacent to a vertex of S or has at least b vertices in S at distance 2 from it in G. The b-disjunctive domination number of G is the minimum cardinality of a b-disjunctive dominating set. In this paper, we continue the study of disjunctive domination in graphs. We present properties of b-disjunctive dominating sets in a graph. A characterization of minimal b-disjunctive dominating sets is given. We obtain bounds on the ratio of the domination number and the b-disjunctive domination number for various families of graphs, including regular graphs and trees.

Full Text:

No subscription journal articles available during site upgrade.
AJOL African Journals Online