incident vertex

基本解釋

Vertex classification based on incident feature edges;
根據(jù)特征邊進(jìn)行頂點(diǎn)分類；
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.
該算法利用二進(jìn)制數(shù)分割無曏圖的頂點(diǎn)集，通過對子圖各頂點(diǎn)的關(guān)聯(lián)集的運(yùn)算産生相應(yīng)的割集。
An edge-coloring is called vertex-distinguishing if every two distinct vertices are incident to different set of colored edges.
一個(gè)圖的邊染色稱爲(wèi)是點(diǎn)可區(qū)別的，如果任意兩個(gè)不同的頂點(diǎn)的關(guān)聯(lián)邊的顔色的集郃不同。