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 (pp.138-148). Springer Verlag [10.1007/978-3-319-25783-9_13].

### Preclusivity and simple graphs: The n–cycle and n–path cases

#### 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.
##### Scheda breve Scheda completa Scheda completa (DC)
paper
Undirected graphs; Preclusivity relation; Rough approximations
English
16th International Conference Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2015)
2015
Yao,Y; Hu, Q; Yu, H; Grzymala-Busse, JW
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
9783319257822
2015
9437
138
148
none
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 (pp.138-148). Springer Verlag [10.1007/978-3-319-25783-9_13].
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.

Utilizza questo identificativo per citare o creare un link a questo documento: `https://hdl.handle.net/10281/95257`
• 12
• 11