Rough graph is the graphical structure of information system with imprecise
knowledge. Tong He designed the properties of rough graph in 2006[6] and
following that He and Shi introduced the notion of edge rough graph[7]. He et
al developed the concept of weighted rough graph with weighted attributes[6].
In this paper, we introduce a new type of labeling called Even vertex {\zeta}-
graceful labeling as weight value for edges. We investigate this labeling for
some special graphs like rough path graph, rough cycle graph, rough comb graph,
rough ladder graph and rough star graph.

本文介绍了一种新的称为偶数顶点 -{\zeta}- 优美标记的图标记方法，并应用于研究粗糙图形结构，包括粗路径图，粗组合图，粗梯形图和粗星形图等图形。

粗图上的 $ζ$- 优美标号

Even vertex $ζ$-graceful labeling on Rough Graph

Rough membership function defines the measurement of relationship between
conditional and decision attribute from an Information system. In this paper we
propose a new method to construct rough graph through rough membership function
$\omega_{G}^F(f)$. Rough graph identifies the pattern between the objects with
imprecise and uncertain information. We explore the operations and properties
of rough graph in various stages of its structure.

本文提出了通过粗糙集近似度函数构建粗糙图的新方法，以便识别具有不精确和不确定信息的对象之间的模式，同时探讨了粗糙图在其结构的各个阶段中的操作和属性。