返回
Vertex rough graphs
DOI:10.1007/s40747-020-00133-8.png)
摘要
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.
Keyword:
Rough set
Edge rough graph
Vertex rough graph
Rough membership function
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.6
论文数:
2.1K
被引数:
6.6K
机构
引用论文
PL02: Probiotic regimen for outpatient gastroenteritis utility of treatment (PROGUT) study: a multicenter randomized controlled trial
CJEM
IF0
Thyroid disease diagnosis via hybrid architecture composing rough data sets theory and machine learning algorithms
SOFT COMPUTING
IF2.5

