边数等于顶点个数的连通图称为单圈图.本文修正了文献[1]中关于奇异单圈图的充要条件,并且利用该条件证明了文献[2]中一个关于非奇异单圈图的猜想.
Connected graphs in which the number of edges equals the number of vertices are called unicyclic graphs. In this paper, a conclusion on the singularity of unicyclic graphs in [1] is amended. Moreover, we prove a conjecture on the nonsingular uricyclic graphs in [2].