PropertyValue
?:abstract
  • Neighborhood systems are used to approximate graphs as finite topological structures. Throughout this article, we construct new types of eight neighborhoods for vertices of an arbitrary graph, say, j-adhesion neighborhoods. Both notions of Allam et al. and Yao will be extended via j-adhesion neighborhoods. We investigate new types of j-lower approximations and j-upper approximations for any subgraph of a given graph. Then, the accuracy of these approximations will be calculated. Moreover, a comparison between accuracy measures and boundary regions for different kinds of approximations will be discussed. To generate j-adhesion neighborhoods and rough sets on graphs, some algorithms will be introduced. Finally, a sample of a chemical example for Walczak will be introduced to illustrate our proposed methods.
is ?:annotates of
?:creator
?:doi
?:doi
  • 10.1007/s41066-020-00245-z
?:externalLink
?:journal
  • Granul
?:license
  • no-cc
?:pdf_json_files
  • document_parses/pdf_json/57610100da322104e2a30015178b35a06a953d55.json
?:pmc_json_files
  • document_parses/pmc_json/PMC7643720.xml.json
?:pmcid
?:publication_isRelatedTo_Disease
?:sha_id
?:source
  • PMC
?:title
  • Rough approximation models via graphs based on neighborhood systems
?:type
?:year
  • 2020-11-05

Metadata

Anon_0  
expand all