1·G is a minimal connected graph.
是一个极小连通图。
2·In this paper, the bond cover of a connected graph was studied.
对连通图的键覆盖进行了研究。
3·We shall see that a tree can be defined as a connected graph which contains no circuits.
我们将看到树可以定义为一个不包含回路的连通图。
4·Introduced in this paper is the forest graph of a connected graph which is a generalization of the tree graph.
本文中引进了连通图的森林图，它是树图的推广。
5·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可收缩边。
6·G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.
一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。
7·In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.
给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。
8·It seems as though, if you can't create a fully connected graph because you have too many nodes, the next best thing would be to create a tree of some kind.
看起来好像，如果你不能创建一个完全连接的图，因为你有太多的节点，下一个最好的事情是创建一个类型的树。
9·The paper gives out an effective calculating method RMA, which changes an arbitrary non-directed graph into a R-side connected graph with minimum enhancement.
本文提出了一个最小地扩充任意无向连通图为r边连通图的有效算法rma。
10·The researchers, who are from various institutions in Italy, explain that their model consists of agents that are represented by nodes in a sparsely connected graph.
这些来自意大利不同学院的研究员们解释道，他们的模型由稀疏图中节点代表的代理组成。