说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 限制性连通度
1)  restricted connectivity
限制性连通度
1.
It is proved that the undirected Kautz graph of maximum degree 4,minimum degree 3 and diameter l has restricted connectivity 4 and restricted fault diameter l +14 at most .
证明直径为l且最小和最大度分别为3和4的无向Kautz图具有限制性连通度4,且其限制性容错直径至多l+14。
2)  restricted edge connectivity
限制性边连通度
1.
Moreover, we evaluate the restricted edge connectivity λ′ and the number of i-edge cutsets m_i,λ≤i<λ′, for Harary graphs explicitly.
给出了Harary图的可靠性分析,证明了它是最优Super λ图;而且精确地计算了它的限制性边连通度和i 边割集的数目mi。
2.
This paper evaluated the restricted edge connectivity of the Cayley graphs with quaisiminimal Cayley set.
研究具有拟极小Cayley集的Cayley图的限制性边连通度 ,证明了除少数例外 ,具有拟极小Cayley集的Cayley图是最优超级边连通
3.
For further study,many variations have been introduced, which are known as higher order connectedness,such as super-κ,hyper-κ,restricted edge connectivityλ_k(G),super-restricted edge connectivity,etc.
为了进一步研究,人们提出了各种各样的高阶连通性的概念,如super-κ性、hyper-κ性和κ-限制性边连通度λ_κ等。
3)  restricted connectivity
限制连通度
1.
On restricted connectivity of some Cartesian product graphs;
一些笛卡尔乘积图的限制连通度(英文)
2.
On the restricted connectivity and (l,k) dominating numbers of pyramid network;
关于金字塔网的限制连通度与(l,k)控制数
3.
It is also shown that,when n≥4,the restricted connectivity of the network is 4 and its restricted fault diameter is n .
证明了当n≥4时,双向双环局域网的限制连通度为4,其限制性容错直径为n。
4)  3-restricted-edge connectivity
3-限制性边连通度
5)  restricted edge neighbor connectivity
限制性边邻域连通度
1.
We also propose a new concept of restricted edge neighbor connectivityλ_(NB)~τ(G),and provethatκ_(NB)(L(G))≤λ_(NB)~τ(G).
提出了一个新的概念:限制性边邻域连通度λ_(NB)~r(G),证明了κ_(NB)(L(G))≤λ_(NB)~r(G)。
6)  restricted edge-connectivity
限制边连通度
1.
As a generalization of classical edge-connectivity,the restricted edge-connectivity can provide a more accurate measure of fault-tolerance for interconnection networks.
而限制边连通度作为传统边连通度的推广是互连网络容错性的一个重要度量。
2.
The restricted edge-connectivity λ′ of de Bruijn digraphs D_B(d,n) was studied.
证明了对有向de B ru ijn图DB(d,n),当d≥3,n≥3或d=2,n≥3或d≥3,n=2时,它的限制边连通度λ′(DB(d,n))=2d-2。
3.
It is known that for connected vertex-transitive graphs of degree k(≥2), the restricted edge-connectivity k≤λ′≤2k-2 and the bounds can be attained.
对于度k( ≥ 2 )的点可迁连通图的限制边连通度λ′,已知k≤λ′≤ 2k- 2 ,且λ′的界可以达到 。
补充资料:单连通和多(复)连通超导体(simplyandmultiplyconnectedsuperconductors)
单连通和多(复)连通超导体(simplyandmultiplyconnectedsuperconductors)

单连通超导体一般指的是不包含有非超导绝缘物质或空腔贯通的整块同质超导体,若有非超导绝缘物质或空腔贯通的超导体则称为多(复)连通超导体。从几何学上讲,在超导体外表面所包围的体积内任取一曲线回路,这回路在超导物质内可收缩到零(或点),且所取的任意回路均可收缩到零而无例外,则称单连通超导体。若有例外,即不能收缩到零,则称多连通超导体。例如空心超导圆柱体,则在围绕柱空腔周围取一回路就不能收缩为零。多连通超导体可有磁通量子化现象(见“磁通量子化”)。

说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条