G is a minimal connected graph.

是一个极小连通图。

In this paper, the bond cover of a connected graph was studied.

对连通图的键覆盖进行了研究。

We shall see that a tree can be defined as a connected graph which contains no circuits.

我们将看到树可以定义为一个不包含回路的连通图。

Introduced in this paper is the forest graph of a connected graph which is a generalization of the tree graph.

本文中引进了连通图的森林图，它是树图的推广。

An edge of a 6 connected graph is said to be 6-contractible if its contraction results still in a 6 connected graph.

如果6连通图的一条边收缩后使得所得到的图仍是6连通，则这条边称为6可收缩边。