Connectedness of Graph and Matroid by Covering-Based Rough Sets

  • Hui LiEmail author
  • William Zhu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9437)


Covering-based rough sets provide an efficient theory to process information in data mining. Matroid theory is a generalization of both linear algebra and graph theory, and has a variety of applications in many fields, such as covering-based rough sets. In this paper, we study the connectedness of graphs and matroids through covering-based rough sets. First, we present an approach to induce a covering by a graph. Then we use the covering upper approximation operator and the rank of matrix representation of the covering to study the connectedness of the graph. Moreover, we give the expression of the number of the connected components of a graph. Second, we establish a matroid based on the covering induced by a graph and study the connectedness of this matroid.


Covering-based rough set Matroid Graph Connectedness Granular computing 



This work is in part supported by The National Nature Science Foundation of China under Grant Nos. 61170128, 61379049 and 61379089, the Key Project of Education Department of Fujian Province under Grant No. JA13192, and the Science and Technology Key Project of Fujian Province, China Grant No. 2012H0043.


  1. 1.
    Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341–356 (1982)CrossRefGoogle Scholar
  2. 2.
    Pawlak, Z.: Rough classification. Int. J. Man-Mach. Stud. 20, 469–483 (1984)CrossRefGoogle Scholar
  3. 3.
    Wu, W., Zhang, W.: Rough set approximations vs. measurable spaces (in chinese). In: Granular Computing (GrC), 2006 IEEE International Conference on Granular Computing, pp. 329–332. IEEE Press, China (2006)Google Scholar
  4. 4.
    Diker, M.: Textural approach to generalized rough sets based on relations. Inf. Sci. 180, 1418–1433 (2010)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Liu, G., Zhu, W.: The algebraic structures of generalized rough set theory. Inf. Sci. 178, 4105–4113 (2008)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Zhu, W., Wang, F.: Reduction and axiomization of covering generalized rough sets. Inf. Sci. 152, 217–230 (2003)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Wang, S., Zhu, W., Zhu, Q., Min, F.: Covering base. J. Inf. Comput. Sci. 9, 1343–1355 (2012)Google Scholar
  8. 8.
    Nettleton, D.F.: Data mining of social networks represented as graphs. Comput. Sci. Revi. 7, 1–34 (2013)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Fukami, T., Takahashi, N.: New classes of clustering coefficient locally maximizing graphs. Discrete Appl. Math. 162, 202–213 (2014)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Huang, A., Zhu, W.: Connectedness of graphs and its application to connected matroids through covering-based rough sets. arXiv preprint arXiv:1312.4234 (2013)
  11. 11.
    Oxley, J.G.: Matroid Theory. Oxford University Press, New York (1993)zbMATHGoogle Scholar
  12. 12.
    Lai, H.: Matroid Theory. Higher Education Press, Beijing (2001)Google Scholar
  13. 13.
    Liu, Y., Zhu, W.: Characteristic of partition-circuit matroid through approximation number. In: Granular Computing (GrC), 2012 IEEE International Conference on Granular Computing, pp. 314–319. IEEE Press, Hangzhou (2012)Google Scholar
  14. 14.
    Zhu, W., Wang, S.: Matroidal approaches to generalized rough sets based on relations. Int. J. Mach. Learn. Cybern. 2, 273–279 (2011)CrossRefGoogle Scholar
  15. 15.
    Liu, C., Miao, D.: Covering rough set model based on multi-granulations. In: Kuznetsov, S.O., Ślęzak, D., Hepting, D.H., Mirkin, B.G. (eds.) RSFDGrC 2011. LNCS, vol. 6743, pp. 87–90. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  16. 16.
    Pomykala, J.A.: Approximation operations in approximation space. Bul. Pol. Acad. Sci. 35, 653–662 (1987)MathSciNetzbMATHGoogle Scholar
  17. 17.
    Chen, J., Li, J., Lin, Y.: On the structure of definable sets in covering approximation spaces. Int. J. Mach. Learn. Cybern. 4, 195–206 (2013)CrossRefGoogle Scholar
  18. 18.
    Wang, S., Zhu, W., Zhu, Q., Min, F.: Characteristic matrix of covering and its application to boolean matrix decomposition. Inf. Sci. 263, 186–197 (2014)MathSciNetCrossRefGoogle Scholar
  19. 19.
    West, D.B., et al.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001)Google Scholar
  20. 20.
    Wang, S., Zhu, Q., Zhu, W., Min, F.: Equivalent characterizations of some graph problems by covering-based rough sets. J. Appl. Math. (2013)Google Scholar
  21. 21.
    Wang, Z.: Graph Theory. Beijing Institute of Technology Press, Beijing (2002) Google 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

  1. 1.Lab of Granular ComputingMinnan Normal UniversityZhangzhouChina

Personalised recommendations