.png){kind=icon}
Return
Vertex rough graphs
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-020-00133-8.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article introduces the notion of vertex rough graph and discusses certain basic graph theoretic definitions and examples. Adjacency of vertices is used to create a matrix corresponding to a vertex rough graph. Also, the membership function of a vertex rough graph is introduced with the help of Pawlak's Rough set theory, and using this certain results are obtained. The concepts of rough precision and rough similarity degree are extended to vertex rough graphs.
Keywords:
Rough set
Edge rough graph
Vertex rough graph
Rough membership function
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.6
Papers:
2.1K
Citations:
6.6K
Organization
Cited Papers
ShareSaveShareSavePL02: Probiotic regimen for outpatient gastroenteritis utility of treatment (PROGUT) study: a multicenter randomized controlled trial.png)
CJEMOAAI
CJEMIF0
OAAIShareSaveShareSaveEnd-of-life decision-making capacity in an elderly patient with schizophrenia and terminal cancer
OAAI
OAAIShareSaveThyroid disease diagnosis via hybrid architecture composing rough data sets theory and machine learning algorithmsSOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSaveShareSaveShareSave
View more