connected graph
基本解释
- [数] 连接图，[数] 连通图
英汉例句
- G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.
一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。 - 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.
用代数方法给出了一个关于连通图顶点度数的不等式，并给出了连通图拟拉普拉斯矩阵的最大特征值的几个上界。 - In this paper we discuss the distribution of vertices of degree 5 on the longest path and cycle and thus give a characterization of contraction critical 5-connected graph in a certain aspect.
讨论收缩临界5-连通图最长路和最长圈上5度点的分布情况，刻画收缩临界5-连通图的结构。
双语例句
词组短语
- connected simple graph 连通简单图
- connected planar graph 连通平面图
- connected noncrossing graph 连通不交图
- connected reduced graph 连通简化图
- connected -graph model 连接图模型
短语
专业释义
- 连通图
- 连接图
- 连通图
In this part. G is 3-connected graph, e is an edge of 3-connected graph, if G — e is a subdivisionof 3-conneeted graph, then r is called an rmuwablr edge of (.
若G-e是3连通图的一个剖分,则称e是3连通图的可去边。 - 连接图
- 连通图
- 连通子图
- 相连图脉