Rough approximation models via graphs based on neighborhood systems.

Graphs Lower approximations Neighborhood system Rough sets Upper approximations j-Accuracy measure

Journal

Granular computing
ISSN: 2364-4974
Titre abrégé: Granul Comput
Pays: Switzerland
ID NLM: 9918787481306676

Informations de publication

Date de publication:
2021
Historique:
received: 06 07 2020
accepted: 19 10 2020
medline: 1 1 2021
pubmed: 1 1 2021
entrez: 16 4 2024
Statut: ppublish

Résumé

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,

Identifiants

pubmed: 38624533
doi: 10.1007/s41066-020-00245-z
pii: 245
pmc: PMC7643720
doi:

Types de publication

Journal Article

Langues

eng

Pagination

1025-1035

Informations de copyright

© Springer Nature Switzerland AG 2020.

Déclaration de conflit d'intérêts

Conflict of interestNo potential conflict of interest was reported by the author.

Auteurs

Abd El Fattah El Atik (AEF)

Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt.

Ashraf Nawar (A)

Department of Mathematics and Computer Science, Faculty of Science, Menoufia University, Shebin El-Kom, Egypt.

Mohammed Atef (M)

Department of Mathematics and Computer Science, Faculty of Science, Menoufia University, Shebin El-Kom, Egypt.

Classifications MeSH