首页 OALib 期刊 OALib 预印 快速投稿通道 排名 新闻 我的图书馆 常见问题 关于我们 关注我们+
 全部 标题 作者 关键词 摘要
 OALib Journal期刊 ISSN: 2333-9721 费用：99美元

 查看量 下载量

 相关文章 Rough matroids based on coverings Geometric lattice structure of covering-based rough sets through matroids Geometric Lattice Structure of Covering-Based Rough Sets through Matroids Some characteristics of matroids through rough sets Connectedness of graphs and its application to connected matroids through covering-based rough sets Matrix approach to rough sets through vector matroids over a field Matroidal Structure of Rough Sets Based on Serial and Transitive Relations Closed-set lattice of regular sets based on a serial and transitive relation through matroids Matroidal structure of generalized rough sets based on symmetric and transitive relations Matroidal structure of rough sets based on serial and transitive relations 更多...

# Connectivity for matroids based on rough sets

 Full-Text   Cite this paper

Abstract:

In mathematics and computer science, connectivity is one of the basic concepts of matroid theory: it asks for the minimum number of elements which need to be removed to disconnect the remaining nodes from each other. It is closely related to the theory of network flow problems. The connectivity of a matroid is an important measure of its robustness as a network. Therefore, it is very necessary to investigate the conditions under which a matroid is connected. In this paper, the connectivity for matroids is studied through relation-based rough sets. First, a symmetric and transitive relation is introduced from a general matroid and its properties are explored from the viewpoint of matroids. Moreover, through the relation introduced by a general matroid, an undirected graph is generalized. Specifically, the connection of the graph can be investigated by the relation-based rough sets. Second, we study the connectivity for matroids by means of relation-based rough sets and some conditions under which a general matroid is connected are presented. Finally, it is easy to prove that the connectivity for a general matroid with some special properties and its induced undirected graph is equivalent. These results show an important application of relation-based rough sets to matroids.

Full-Text