Preclusivity and simple graphs: the n-cycle and n-path cases

DOI10.1007/978-3-319-25783-9_13MaRDI QIDQ3300263zbMATH OpenOpenAlexFDO

Authors Davide Ciucci, F. Infusino, G. Chiaselotti, T. Gentile

Publication date 28 July 2020

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

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

zbMATH Keywords

preclusivity relationrough approximationsundirected graphs

Mathematics Subject Classification ID

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

Recommendations

• Preclusivity and simple graphs
• New rough approximations for \(n\)-cycles and \(n\)-paths
• The \(*\)-closure for graphs and claw-free graphs
• The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
• Path-set induced closure operators on graphs

Cites work

• Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
• Graph theory
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 1303618 (Why is no real title available?)
• 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

Cited in

(7)

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

This page was built for publication: Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300263)