loading

Category: Issue 1

Disjoint total Restrained Dominating sets in Graphs

V. R. KULLI
Department of Mathematics, Gulbarga University, Gulbarga – 585 106 (India)
B. CHALUVARAJU
Department of Mathematics, Bangalore University, Jnanabharathi Campus Bangalore -560 056 (India)
M. KUMARA
Department of Mathematics, Bangalore University, Jnanabharathi Campus Bangalore -560 056 (India)

ABSTRACT:

The disjoint total restrained domination number of a graph G is the minimum cardinality of the union of two disjoint total restrained dominating sets in G. We also consider an invariant the minimum cardinality of the disjoint union of a restrained dominating set and a total restrained dominating set. In this paper, we initiate a study of these parameters and establish some results on these new parameters.

KEYWORDS: Inverse domination set, restrained dominating set, total restrained dominating set


The disjoint total restrained domination number of a graph G is the minimum cardinality of the union of two disjoint total restrained dominating sets in G. We also consider...