如果一个图是不连通的或有割点，就发生这种情况。
This happens if the graph is disconnected or has a cut vertex.
根据标号有向块的指数型生成函数，研究了具有唯一一个割点的标号有向连通图及所有割点都在一个块上的标号有向连通图的计数问题。
The essay has a study on enumeration question labeled oriented connected graphs with only one cut vertices and labeled oriented connected graphs that all of cut vertices are in same block.
对于网络拓扑而言模型得到的割点分布即为网络中关键节点的分布，而块图就是安全审计域的规划分布。
The division point in this model was called security node and the block graphics was called audit domain distributing graphics.
应用推荐