如果一个图是不连通的或有割点，就发生这种情况。
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.
最后，对于有割点的图的谱半径给出一个与子图的谱半径有关的一个不等式。
Finally, for the spectral radius of a graph with a cut vertex, we give an inequality concerning the spectral radius of the graph and its subgraphs.
同时给出4连通图4圈上和边点割原子及分离对上的可去边的分布。
Moreover, the distribution of removable edges in the edge-vertex cut atom and its separating pair for 4-connected graphs was obtained.
同时给出4连通图4圈上和边点割原子及分离对上的可去边的分布。
Moreover, the distribution of removable edges in the edge-vertex cut atom and its separating pair for 4-connected graphs was obtained.
应用推荐