The adjacency relation of a simple undirected graph is a preclusive (irreflexive and symmetric) relation. Hence, it originates a preclusive space enabling us to define the lower and upper preclusive approximations of graphs and two orthogonality graphs. Further, the possibility of defining the similarity lower and upper approximations and the sufficiency operator on graphs will be investigated, with particular attention to complete and bipartite graphs. All these mappings will be put in relation with Formal Concept Analysis and the theory of opposition.
Chiaselotti, G., Ciucci, D., Gentile, T., Infusino, F. (2015). Preclusivity and simple graphs. In ROUGH SETS, FUZZY SETS, DATA MINING, AND GRANULAR COMPUTING, RSFDGRC 2015 (pp.127-137). Springer Verlag [10.1007/978-3-319-25783-9_12].
Preclusivity and simple graphs
CIUCCI, DAVIDE ELIO
Secondo
;
2015
Abstract
The adjacency relation of a simple undirected graph is a preclusive (irreflexive and symmetric) relation. Hence, it originates a preclusive space enabling us to define the lower and upper preclusive approximations of graphs and two orthogonality graphs. Further, the possibility of defining the similarity lower and upper approximations and the sufficiency operator on graphs will be investigated, with particular attention to complete and bipartite graphs. All these mappings will be put in relation with Formal Concept Analysis and the theory of opposition.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
