Moreover, the distribution of removable edges in the edge-vertex cut atom and its separating pair for 4-connected graphs was obtained.
同时给出4连通图4圈上和边点割原子及分离对上的可去边的分布。
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.
该算法利用二进制数分割无向图的顶点集，通过对子图各顶点的关联集的运算产生相应的割集。
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.
最后，对于有割点的图的谱半径给出一个与子图的谱半径有关的一个不等式。
In order to distinguish the two kinds of cuts we sometimes call this a vertex-cut and the other one an edge-cut.
为了区别两种割，有时称这种割为顶点割，而另一种叫做边割。
In order to distinguish the two kinds of cuts we sometimes call this a vertex-cut and the other one an edge-cut.
为了区别两种割，有时称这种割为顶点割，而另一种叫做边割。
应用推荐