如果一个图是不连通的或有割点，就发生这种情况。
This happens if the graph is disconnected or has a cut vertex.
我们将看到树可以定义为一个不包含回路的连通图。
We shall see that a tree can be defined as a connected graph which contains no circuits.
对不连通的图输出其各个连通支(C)。
Is not connected to the output of its various connectivity graph branch (c).
一个三角形若删去其顶点后使图不连通，则这个三角形称为分离三角形。
Where a separating triangle is a triangle that removal separates the graph.
本文给出所有能级不超过4的连通偶图 ，并给出关于图的能级与其边的个数的一个不等式 。
This paper presents all the connected simple bigraphs whose energy does not exceed 4, and an inequality about the energy of a graph and the number of the edges of the graph.
本文给出所有能级不超过4的连通偶图 ，并给出关于图的能级与其边的个数的一个不等式 。
This paper presents all the connected simple bigraphs whose energy does not exceed 4, and an inequality about the energy of a graph and the number of the edges of the graph.
应用推荐