片语

cording diagram接线图，连接图；塞绳连接图

connected noncrossing graph连通不交图

connected planar graph连通平面图

connected undirected graph连接无向图

connected simple graph连通简单图

rooted connected directed graph带根连通有向图

connected reduced graph连通简化图

connected-graph model连接图模型

connected subsidiary graph连通子

英汉例句

• 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.

  用代数方法给出了一个关于连通图顶点度数的不等式，并给出了连通图拟拉普拉斯矩阵的最大特征值的几个上界。

• i like the idea that it creates a fully connected graph of nodes, but upon reading different articles online, it seems as though this doesn「t scale well (having a max of 50 - 100 nodes).

  我喜欢它创建一个完全连接的节点图，但在在线阅读不同的文章，似乎这不能很好地扩展（最多有50- 100个节点）的想法。

• 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可收缩边。

• let g be a finite simple connected graph with a perfect matching.

  设g是一个连通的简单图且具有完美匹配。

• in particular, a new necessary and sufficient condition is given for a connected graph g containing a perfect matching.

  特别，我们给出了连通图g具有完美匹配的一个新的充要条件。

• 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的边不相交圈的最大数目。

• the traditional search algorithm has been improved based on the features of connected graph so that it can calculate operation steps of any specific scheduled task automatically.

  针对连接图的这一特点，改进传统的搜索算法，使之可以针对调度任务自动计算操作步骤。

• the critical group of a connected graph is a finite abelian group whose order is the number of spanning trees in the graph and is closely related to the graph laplacian.

  图的临界群是图生成树数目的一个加细，图的临界群的阶数恰为该图的生成树的数目。

• a tree is a connected graph with no cycles .

  一个树是一个没有圈的连通图。

• g is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.

  一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。

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

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

• 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。

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

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

• 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.

  看起来好像，如果你不能创建一个完全连接的图，因为你有太多的节点，下一个最好的事情是创建一个类型的树。

• the paper gives a convenient and fast algorithm to find total spanning trees of a connected graph by the supplemented incidence matrix of the graph.

  利用连通图的增广关联矩阵，给出了求连通图的全部互异的生成树的一种简单、快捷的算法。

• a weighted path algorithm and a connected graph algorithm were developed to automatically find multicasting faults in large multicasting networks.

  在此基础上，提出两种故障定位算法，即基于经验的路径加权法和基于图论的连通图算法。

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

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

• in this paper it is proved by the rank transformation that maximum rank of the adjacent matrixes of all spanning trees of a connected graph g is twice the line independence number of the graph g.

  本文中我们用等秩变换证明了连通图g的所有生成树的邻接矩阵的秩中最大者就是图g线独立数的两倍。