Preclusivity and Simple Graphs: The n–cycle and n–path Cases

DOI10.1007/978-3-319-25783-9_13zbMath1444.68200OpenAlexW2295674735MaRDI QIDQ3300263

Davide Ciucci, F. Infusino, Tommaso Gentile, Giampiero Chiaselotti

Publication date: 28 July 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25783-9_13

zbMATH Keywords

undirected graphsrough approximationspreclusivity relation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (7)

Indiscernibility structures induced from function sets : Graph and digraph case ⋮ The adjacency matrix of a graph as a data table: a geometric perspective ⋮ Notions from rough set theory in a generalized dependency relation context ⋮ Dependency structures for decision tables ⋮ Dependency and accuracy measures for directed graphs ⋮ Decision systems in rough set theory: A set operatorial perspective ⋮ Preclusivity and Simple Graphs

Cites Work

• Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
• Preclusivity and Simple Graphs
• Simple Undirected Graphs as Formal Contexts
• The Structure of Oppositions in Rough Set Theory and Formal Concept Analysis - Toward a New Bridge between the Two Settings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Preclusivity and Simple Graphs: The n–cycle and n–path Cases