Preclusivity and Simple Graphs: The n–cycle and n–path Cases
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile, Federico G. Infusino · Lecture notes in computer science · 2015
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.