- 更多网络例句与非连通图相关的网络例句 [注：此内容来源于网络，仅供参考]
-
And the formulae for estimatingthe edge-toughness of Cartesian product and Kronecker product of some special graphs are presented.
证明了一类r-正则r=κ′连通非完全图G的边坚韧度近似等于r/21+(1/│V│-1并且提供了估计一些特殊图类的笛卡儿积和Kronecker积的边坚韧度的公式。
-
The present paper studies the structure of the set of non-wandering points of a continuous map from a Graph(i.e., one-dimensional connected compact branched manifold) into itself.
本文主要研究了图(即一维紧致连通的分支流形)上连续自映射的非游荡集的结构。
-
The finite nonabelian simple group PSL(2,23) has the minimum degree 506 GR of connected cubic arc-transitive coset graphs.
有限非交换单群PSL(2，17)的最小级连通3度弧传递陪集图表示的级是102。
-
By using the algebraic method, we obtain a new formula for the expected hitting time of random walks on strong-connected and aperiodic digrahs (irreducible and aperiodic Markov chain). From this formula, we obtain the explicit expressions for the expected hitting times of random walks on directed de Bruijn graph, directed Kautz graph and some graphs constructed from strong regular graph, etc.
利用代数方法给出了强连通非周期有向图上随机游动（即不可约非周期马尔可夫链）平均首达时间一个新的表达式，并利用这个表达式得到了有向de Bruijn图，有向Kautz图以及和强正则图相关的几类图上随机游动任意两点之间的平均首达时间。
-
This study presents a new multilayer implicit connection graph-based gridless router called NEMO. Unlike the first implicit connection graph-based router that embeds all routing layers onto a routing plane, NEMO constructs a routing plane for each routing layer.
这个研究提出一个新的以隐性连通图为基础的多层非格子绕线器尼摩，它不像之前第一个以隐性连通图为基础的绕线器埋置所有层到一个绕线平面，尼摩一个绕线层就建构一个绕线平面。
-
The minimum number of verticesof G whose removal from G results either in a graph that is no longer connected or in a trivial graph with a single vertex: at least K vertices must be removed from a graph with K-connectivity.
从图g中移去顶点使图成为一个非连通图或是单个顶点的"平凡图"的最少顶点数称为连通度。一个k连通度的图至少必须从图g中移去k个顶点才能成为非连通图。
-
In the subcase that K is doubly transitive on every block B〓, there is exactly one non-primitive connected arc-transitive graph on Z〓×Z〓p.
设Γ=Cay是G=Z〓×Z〓上的非本原连通弧传递图，B={B〓，B〓，…，B〓}是A=Aut在V=G上的非平凡完全块系，而K是A=Aut在B上作用的核。
- 更多网络解释与非连通图相关的网络解释 [注：此内容来源于网络，仅供参考]
-
connected graph：连通图
节点不重复出现的链称为路径(path);在有向图中,节点不重复出现且链中所有弧的方向一致,则称为有向路径(directed path)无向图中,若任意两点间至少存在一条路径,则称为连通图(connected graph),否则为非连通图( discon-nected graph);
-
heuristic algorithm：算法
否则为非连通图( discon-nected graph);非连通图中的每个连通子图称为成分 (component)树图:倒置的树,根(root)在上,树叶(leaf)在下基本算法:找一条从 s 到 t 点的增广链(augmenting path)TSP 的启发式算法(Heuristic algorithm)三个问题的解都可以
-
root：树根
则称为有向路径(directed path)无向图中,若任意两点间至少存在一条路径,则称为连通图(connected graph),否则为非连通图( discon-nected graph);非连通图中的每个连通子图称为成分 (component)树图:倒置的树,根(root)在上,树叶(lea
-
unconnected graph：非连通图
连通图 connected graph | 非连通图 unconnected graph | 强连通图 strongly connected graph