Disjoint total Restrained Dominating sets in Graphs

AUTHOR AND
AFFILIATION

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)

KEYWORDS:

Inverse domination set, restrained dominating set, total restrained dominating set

Issue Date:

January 2020

Pages:

1-5

ISSN:

2319-8044 (Online) – 2231-346X (Print)

Source:

Vol.32 – No.1

PDF

Click Here Download PDF

DOI:

http://dx.doi.org/10.22147/jusps-A/320101

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.

Copy the following to cite this Article:

V. R. Kulli; B. Chaluvaraju; M. Kumara, “Disjoint total Restrained Dominating sets in Graphs”, Journal of Ultra Scientist of Physical Sciences, Volume 32, Issue 1, Page Number 1-5, 2020


Copy the following to cite this URL:

V. R. Kulli; B. Chaluvaraju; M. Kumara, “Disjoint total Restrained Dominating sets in Graphs”, Journal of Ultra Scientist of Physical Sciences, Volume 32, Issue 1, Page Number 1-5, 2020

Available from: http://www.ultrascientist.org/paper/1523/