Abstract
The incidence matrix of a simple undirected graph is used as an information table. Then, rough set notions are applied to it: approximations, membership function, positive region and discernibility matrix. The particular cases of complete and bipartite graphs are analyzed. The symmetry induced in graphs by the indiscernibility relation is studied and a new concept of generalized discernibility matrix is introduced.
Author supplied keywords
Cite
CITATION STYLE
Chiaselotti, G., Ciucci, D., Gentile, T., & Infusino, F. (2015). Rough set theory applied to simple undirected graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9436, pp. 423–434). Springer Verlag. https://doi.org/10.1007/978-3-319-25754-9_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
