利用组合理论和图的计数理论，讨论了只含有一个非平凡块的连通图的计数问题，给出了新的结论。
The enumeration problem for connective graphs with one nontrivial block was discussed by the theory of combinatorics, and the new conclusion is also given.
利用计数理论并借助于这两类图的特殊构造，得出了相应的结论。
Some conclusions are obtained by means of the special structure of two types of graphs.
应用推荐