Transitive closures and orderings on soft sets

Authors:
K. V. Babitha;Jacob John Sunil
Affiliations:
-;-
Venue:
Computers & Mathematics with Applications
Year:
2011

Citing 10
Cited 1

Discrete mathematics for computer scientists & mathematicians (2nd ed.)

Discrete mathematics for computer scientists & mathematicians (2nd ed.)
Soft sets and soft groups

Information Sciences: an International Journal
Soft semirings

Computers & Mathematics with Applications
The parameterization reduction of soft sets and its applications

Computers & Mathematics with Applications
Exclusive disjunctive soft sets

Computers & Mathematics with Applications
On soft equality

Journal of Computational and Applied Mathematics
Soft sets and soft modules

RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Soft set relations and functions

Computers & Mathematics with Applications
The bijective soft set with its operations

Computers & Mathematics with Applications
Kernels and closures of soft set relations, and soft set relation mappings

Computers & Mathematics with Applications

Entropy on intuitionistic fuzzy soft sets and on interval-valued fuzzy soft sets

Information Sciences: an International Journal

Quantified Score

Hi-index	0.09

Visualization

Abstract

In this paper an attempt is made to extend some standard results in set theory on the basis of soft set relations. Antisymmetric relation and transitive closure of a soft set relation are introduced and an analogue of Warshall's algorithm is proposed for calculating the transitive closure of a soft set relation. Ordering on a soft set is defined and some set theoretical results based on this are proved.