Rough Set Theory Applied to Simple Undirected Graphs

  • Giampiero Chiaselotti
  • Davide CiucciEmail author
  • Tommaso Gentile
  • Federico Infusino
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9436)


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.


Undirected graphs Neighborhood Discernibility matrix Complete graphs Bipartite graphs Symmetry 


  1. 1.
    Chen, J., Li, J.: An application of rough sets to graph theory. Inf. Sci. 201, 114–127 (2012)MathSciNetCrossRefGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Chiaselotti, G., Ciucci, D., Gentile, T.: Simple graphs in granular computing. Submitted to Information Sciences (2015)Google Scholar
  4. 4.
    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) CrossRefGoogle Scholar
  5. 5.
    Diestel, R.: Graph Theory, Graduate Text in Mathematics, 4th edn. Springer, Heidelberg (2010) Google Scholar
  6. 6.
    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) CrossRefGoogle Scholar
  7. 7.
    Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publisher, Dordrecht (1991) CrossRefGoogle Scholar
  8. 8.
    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) Google Scholar
  9. 9.
    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/973920MathSciNetCrossRefGoogle Scholar
  10. 10.
    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/519173zbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (, 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.

Authors and Affiliations

  • Giampiero Chiaselotti
    • 2
  • Davide Ciucci
    • 1
    Email author
  • Tommaso Gentile
    • 2
  • Federico Infusino
    • 2
  1. 1.DISCoUniversity of Milano – BicoccaMilanoItaly
  2. 2.Department of Mathematics and InformaticsUniversity of CalabriaArcavacata di RendeItaly

Personalised recommendations