Rough Set Theory Applied to Simple Undirected Graphs
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile, Federico G. Infusino · Lecture notes in computer science · 2015
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.