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.

中文翻译：

---

顶点粗糙图

本文介绍了顶点粗糙图的概念，并讨论了一些基本的图形理论定义和示例。顶点的邻接用于创建与顶点粗糙图相对应的矩阵。此外，借助Pawlak的粗糙集理论引入了顶点粗糙图的隶属函数，并使用此确定的结果。粗糙精度和粗糙相似度的概念被扩展到顶点粗糙图。