incident vertex

基本解释

Vertex classification based on incident feature edges;
根据特征边进行顶点分类；
The algorithm use a binary digit to divide the vertex set of a non-direction graph, and employ the incident sets of the vertices in the subgraph to produce opposite cut sets.
该算法利用二进制数分割无向图的顶点集，通过对子图各顶点的关联集的运算产生相应的割集。
An edge-coloring is called vertex-distinguishing if every two distinct vertices are incident to different set of colored edges.
一个图的边染色称为是点可区别的，如果任意两个不同的顶点的关联边的颜色的集合不同。