
AbstractIn this paper, the notions of anti-reflexive kernel, symmetric kernel, reflexive closure, and symmetric closure of a soft set relation are first introduced, respectively. Then, their accurate calculation formulae and some properties are obtained. Finally, soft set relation mappings and inverse soft set relation mappings are proposed, and some related properties are discussed.
Soft set relation mappings, Computational Mathematics, Soft sets, Soft set relations, Computational Theory and Mathematics, Kernels, Modelling and Simulation, Closures, Inverse soft set relation mappings
Soft set relation mappings, Computational Mathematics, Soft sets, Soft set relations, Computational Theory and Mathematics, Kernels, Modelling and Simulation, Closures, Inverse soft set relation mappings
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 50 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
