Preclusivity and Simple Graphs: The n–cycle and n–path Cases
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.
KeywordsUndirected graphs Preclusivity relation Rough approximations
- 2.Cattaneo, G.: Abstract approximation spaces for rough theories. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery 1: Methodology and Applications. Studies in Fuzziness and Soft Computing, pp. 59–98. Physica Verlag, Heidelberg (1998)Google Scholar
- 4.Chiaselotti, G., Ciucci, D., Gentile, T., Infusino, F.: Preclusivity and simple graphs. In: Yao, Y., Hu, Q., Yu, H. Grzymala-Busse, J. (eds.) RSFDGrC 2015. LNCS, vol. 9437, pp. 127–137. Springer, Heidelberg (2015)Google Scholar
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.