大家都搜：
[数]连接图，[数]连通图
1、sine graph───正弦图
2、endothermic graph───吸热图
3、line graph───线状图表；线图
4、cosmically connected───宇宙连接
5、hydraulically connected───液压连接
6、hp connected───hp已连接
7、antipodal graph───反足图
8、connected───adj.[计]连接的；有联系的；连贯的；v.连接（connect的过去式）
9、dependencies graph───相关图；[计]依赖图
1、paper, the bond cover of a connected graph was studied.───对连通图的键覆盖进行了研究。
2、The Number of Removable Edges in a Spanning Tree of a 3-Connected Graph───3-连通图支撑树上的可去边数
3、Minimum Augmentation of an Arbitrary Graph to an R-Vertex-Connected Graph───任意无向图的R点连通扩充
4、The Augmentation Problem of a Directed Tree Graph to a K-Connected Graph───有向树图的最小K点连通扩充
5、We shall see that a tree can be defined as a connected graph which contains no circuits.───我们将看到树可以定义为一个不包含回路的连通图。
6、An Approximation Algorithm for Finding the Longest Path in Undirected Connected Graph under Constrains───无向连通图中求约束条件下近似最长路算法
7、is a minimal connected graph.───是一个极小连通图。
8、An undirected connected graph with no cycles is called a tree. A vertex with degree equal to one in a tree is called a leaf.───一个无环无向连通图称为一棵树。树中一个度为一的点称为叶子结点。
1、An inequality about degree of vertex of a connected graph can be given, and the upper bounds of the largest eigenvalue of the quasi-Laplacian matrix of a connected graph can be obtained.
2、An undirected connected graph with no cycles is called a tree. A vertex with degree equal to one in a tree is called a leaf.
3、G is a minimal connected graph.
4、A non complete 6 connected graph is called contraction - critical if it has no any 6 - contractible edge.
5、Let G be a simple finite connected graph.
6、In this paper, the bond cover of a connected graph was studied.
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.
8、A tree is a connected graph with no cycles.
9、An edge of a 6 connected graph is said to be 6-contractible if its contraction results still in a 6 connected graph.