Disjoint total Restrained Dominating sets in Graphs
Author & 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)
Keyword:
Inverse domination set, restrained dominating set, total restrained dominating set
Issue Date:
January 2020
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.
Pages:
1-5
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
DOI:
http://dx.doi.org/10.22147/jusps-A/320101
Share This:
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, 2020Copy 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, 2020Available from: https://www.ultrascientist.org/paper/1523/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
