Two classes of graphs, the n–cycles and n–paths, are interpreted as preclusivity spaces. In this way, it is possible to define two pairs of approximations on them: one based on a preclusive relation and another one based on a similarity relation. Further, two relations can be defined among the set of vertices and they define two different graphs, which are here studied.
Chiaselotti, G., Ciucci, D., Gentile, T., Infusino, F. (2015). Preclusivity and simple graphs: The n–cycle and n–path cases. In Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing 15th International Conference, RSFDGrC 2015, Tianjin, China, November 20-23, 2015, Proceedings (pp.138-148). Springer Verlag [10.1007/978-3-319-25783-9_13].
Preclusivity and simple graphs: The n–cycle and n–path cases
CIUCCI, DAVIDE ELIO
Secondo
;Gentile, T;
2015
Abstract
Two classes of graphs, the n–cycles and n–paths, are interpreted as preclusivity spaces. In this way, it is possible to define two pairs of approximations on them: one based on a preclusive relation and another one based on a similarity relation. Further, two relations can be defined among the set of vertices and they define two different graphs, which are here studied.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
