BASES AND CIRCUITS OF FUZZIFYING MATROIDS
نویسندگان
1 The Fujian Provincial Key Laboratory of Network Security and Cryptology, School of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350007, P.R. China
2 School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 102488, P.R. China; Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, Beijing 102488, P.R. China
doi
10.22111/ijfs.2018.3755چکیده
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis axioms or circuit axioms.
