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.
This is a preview of subscription content, log in via an institution to check access.
References
Chen, J., Li, J.: An application of rough sets to graph theory. Inf. Sci. 201, 114–127 (2012)
Cattaneo, G., Chiaselotti, G., Ciucci, D., Gentile, T.: On the connection of hypergraph theory with formal concept analysis and rough set theory. Submitted to Information Sciences (2015)
Chiaselotti, G., Ciucci, D., Gentile, T.: Simple graphs in granular computing. Submitted to Information Sciences (2015)
Chiaselotti, G., Ciucci, D., Gentile, T.: Simple undirected graphs as formal contexts. In: Baixeries, J., Sacarea, C., Ojeda-Aciego, M. (eds.) ICFCA 2015. LNCS, vol. 9113, pp. 287–302. Springer, Heidelberg (2015)
Diestel, R.: Graph Theory, Graduate Text in Mathematics, 4th edn. Springer, Heidelberg (2010)
Midelfart, H., Komorowski, J.: A rough set framework for learning in a directed acyclic graph. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, p. 144. Springer, Heidelberg (2002)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publisher, Dordrecht (1991)
Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Słowiński, R. (ed.) Intelligent Decision Support. Theory and Decision Library, vol. 11. Springer, Netherlands (1992)
Tang, J., She, K., William Zhu, W.: Matroidal structure of rough sets from the viewpoint of graph theory. J. Appl. Math. 2012 (2012). doi:10.1155/2012/973920
Wang, S., Zhu, Q., Zhu, W., Min, F.: Equivalent characterizations of some graph problems by covering-based rough sets. J. Appl. Math. 2013 (2013). doi:10.1155/2013/519173
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Chiaselotti, G., Ciucci, D., Gentile, T., Infusino, F. (2015). Rough Set Theory Applied to Simple Undirected Graphs. In: Ciucci, D., Wang, G., Mitra, S., Wu, WZ. (eds) Rough Sets and Knowledge Technology. RSKT 2015. Lecture Notes in Computer Science(), vol 9436. Springer, Cham. https://doi.org/10.1007/978-3-319-25754-9_37
Download citation
DOI: https://doi.org/10.1007/978-3-319-25754-9_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25753-2
Online ISBN: 978-3-319-25754-9
eBook Packages: Computer ScienceComputer Science (R0)