您要查找的是不是：
- quasi strongly connected graph 准强连通图
- kernel of strongly connected graph 有向强连通图的核
- The Judging Between Single Connected Graph and Strong Connected Graph 单侧连通图与强连通图的判定
- New Algorithm for Generating Strongly Connected Graphs 基于核的有向强连通图计算机随机生成算法
- A tree is a connected graph with no cycles. 一个树是一个没有圈的连通图。
- strongly connected graph 强连通的图,强连通图
- Let G=(V,E)be a simple connected graph,and dv be the degree of vertex v. 图G=(V,E)为简单连通图,dv表示顶点v的度。
- What else could explain why we feel so strongly connected to him or her? 除此之外,还有什么能够说明我们能与上师如此紧密地结合在一起呢?
- An articulation point is a vertex of a connected graph which can be split to yield an unconnected graph. 如果一个连通图的一个顶点能被分割，从而使这图成为一个不连通图，则这个顶点称为断点。
- Strong connection graph 强连通图
- strongly connected directed graph 强连通的有向图
- Introduced in this paper is the forest graph of a connected graph which is a generalization of the tree graph. 摘要本文中引进了连通图的森林图，它是树图的推广。
- A noncomplete6 connected graph is called contraction-critical if it has no any6- contractible edge. 一个不包含6可收缩边的非完全图被称为收缩临界6连通图.
- Using matrix theory, we present a sharp upper bound on the spectral radius of digraphs and strongly connected diagraphs. 摘要利用矩阵理论，给出了简单有向图的谱半径可达上界和强连通有向图的谱半径上界。
- Make a strong connection to the natural energies of the Earth. 与大地紧密地相连,从大地中汲取自然的能量。
- The critical group of a connected graph is a finite abelian group whose structure is a subtle isomorphism invariant of the graph. 图的临界群是图生成树数目的一个加细.;它是定义在图上的一个有限交换群;其群结构是图的一个精细不变量;与图的Laplacian理论密切相关
- Although the utility can be argued, the familiarity is also important for a brand so strongly connected to it's design as ThinkPad. 尽管功用性是很重要的一点，但是保持用户对产品的熟悉对一个品牌来说同样重要，尤其是对ThinkPad。
- According to the judging theory of Euler entry (or circuit) in undirected connected graph, the algorithm and program of computer solution are decided. 根据无向连通图中欧拉通路或欧拉回路的判定定理,给出计算机求解的算法和程序。
- 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. 一个无环无向连通图称为一棵树。树中一个度为一的点称为叶子结点。
- A weighted path algorithm and a connected graph algorithm were developed to automatically find multicasting faults in large multicasting networks. 在此基础上,提出两种故障定位算法,即基于经验的路径加权法和基于图论的连通图算法。
