Using Soft Set Relations and Mappings of Kernels and Closures
K. Geetha1, N. Anitha2
1K. Geetha*, Research scholar Periyar University PG Extension center-Dharmapuri.
2Dr. N. Anitha, Department of Mathematics , Periyar University PG Extension center-Dharmapuri , India.
Manuscript received on February 10, 2020. | Revised Manuscript received on February 20, 2020. | Manuscript published on March 30, 2020. | PP: 1118-1122 | Volume-8 Issue-6, March 2020. | Retrieval Number: F7146038620/2020©BEIESP | DOI: 10.35940/ijrte.F7146.038620
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Abstract: In this paper, the views of anti-reflexive kernel, symmetric kernel, reflexive closure, and symmetric closure of a SS relation are initially presented, respectively. Then, their correct calculation formulae and a few laws are received. Finally, SS relation function and inverse SS relation functions are introduced, and some related conditions are discussed.
Keywords: Soft sets (SS) relations Kernels Closures SS relation functions Inverse SS relation functions. In this paper using SS means (Soft set).
Scope of the Article: Soft computing Signal and Speech Processing.