The incidence matrix of a simple undirected graph is used as an information table. Then, rough set notions are applied to it: approxi- mations, 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.
Rough Set Theory Applied to Simple Undirected Graphs
Giampiero Chiaselotti
;Tommaso Gentile;Federico G. Infusino
2015-01-01
Abstract
The incidence matrix of a simple undirected graph is used as an information table. Then, rough set notions are applied to it: approxi- mations, 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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
