说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 限制性边邻域连通度
1)  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)。
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)  vertex(edge)neighbor-connectivity
点(边)邻域连通度
4)  edge neighbor connectivity
边邻域连通度
1.
In this paper,we study the relationship between the edge neighbor connectivityλ_(NB) of agraph G and the(vertex) neighbor connectivityκ_(NB) of its line graph L(G),and prove thatλ_(NB)(G)≤κ_(NB)(L(G)).
研究了图G的边邻域连通度λ_(NB)(G)和它的线图L(G)的点邻域连通度κ_(NB)(L(G))之间的关系,证明了λ_(NB)(G)≤κ_(NB)(G)。
2.
The number of edges in a minimum edge cut strategy is defined to be the edge neighbor connectivity.
G的最小割边策略所含的边数为边邻域连通度。
5)  3-restricted-edge connectivity
3-限制性边连通度
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 ,且λ′的界可以达到 。
补充资料:限制
分子式:
CAS号:

性质:一种保护细菌细胞不受外源DNA侵入的作用,通过限制性内切酶实现。该酶对双链DNA进行定点剪切。通常合成限制性内切酶的细胞由于还能合成识别同样位点的修饰酶而使细胞本身的DNA结构进行修饰,如甲基化而受到保护。当细菌受到噬菌体感染,而噬菌体DNA事先未经修饰,则这未经修饰的外来噬菌体DNA被切成小片段,再进一步为外切核酸酶所降解。未经修饰的噬菌体DNA引起感染的可能性比修饰过的噬菌体DNA要小几个数量级。   

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