边连通度的英文

• edge connectivity
• line-connectivity

• "边"英文翻译    side; section
• "连通"英文翻译    feed through; connection; co ...
• "度"英文翻译    surmise; estimate
• "线连通度 边连通度" 英文翻译 :    line-connectivity
• "连通度" 英文翻译 :    connectivity; degree of communication; interconnectedness
• "连通性, 连通度" 英文翻译 :    connectivity
• "连通性，连通度" 英文翻译 :    connectivity
• "边连通图" 英文翻译 :    edge connected graph
• "单位连通度" 英文翻译 :    specific connectivity
• "点连通度" 英文翻译 :    node connectivity; point-connectivity; vertex connectivity
• "局部连通度" 英文翻译 :    local connectivity
• "连通度对" 英文翻译 :    connectivity pair
• "连通度函数" 英文翻译 :    connectivity function
• "双连通度" 英文翻译 :    twoconnectivity
• "线连通度" 英文翻译 :    line connectivity; line-connectivity
• "不连通度量空间" 英文翻译 :    disconnected metric space
• "完全不连通度量空间" 英文翻译 :    totally disconnected metric space
• "连通" 英文翻译 :    feed through; connection; connected; intercommunication
• "边连杆" 英文翻译 :    side rod
• "共通度" 英文翻译 :    communality
• "接通度" 英文翻译 :    accessibility
• "流通度" 英文翻译 :    rate of filtration
• "通度寺" 英文翻译 :    tongdosa
• "板边连接器" 英文翻译 :    edge-board connector
• "单边连接" 英文翻译 :    unilateral connection

• Restricted edge connectivity of binary undirected kautz graphs
  图的限制性边连通度
• On restricted edge - connectivity of vertex - transitive graphs
  点可迁图的限制边连通度
• The classical measure of the reliability is the connectivity and the edge connectivity
  衡量网络可靠性的经典参数为图的连通度和边连通度。
• In the last chapter , we use the results of higher order edge connectivity to study the tree decomposition of transitive graphs , deriving a sufficient condition for a graph to have tree number equivalent to the arboricity
  在最后一章中，我们使用高阶边连通度的结果研究对称图中树分解的一个问题，给出了森林数等于树数的一个充分条件。
• Then , because the connectivity , super connectedness , restricted connectivity and restricted - connectivity of a graph are important parameters to measure fault - tolerance of an interconnection network , they are of very important significance in design and analysis of fault - tolerant interconnection network in reality
  图的连通度，超连通度，限制连通度以及限制边连通度是用来测量互连网容错性的重要参数。在实际容错网络设计和分析中有重要意义。
• But the difficulty with these two parameters is that they do not take into account what remains after the graph is disconnected . in fact , on one hand , it is often found that two graphs with the same number of vertices ( edges ) and the same connectivity ( edge - connectivity ) ) may result in entirely different forms after a minimum disconnecting set of vertices ( edges ) is removed , one may be totally disconnected while the other may consist of a few very stable components , and thus be much easier to reconstruct
  对于两个具有相同点(边)数，具有相同点连通度(边连通度)的图，从图中分别去掉使图不连通的点(边)集后，所得图的结构可能完全不同，这是因为点连通度、边连通度和局部点、边连通度等连通性参数仅反映了系统被破坏的难易程度，而对系统遭受破坏的程度并没有明确的反映。
• For further study , many variations have been introduced , which are known as higher order connectedness , such as super - connectedness , hyper - connectedness , super - a , r - restricted edge connectivity , etc . this dissertation studies graphs , especially symmetric graphs , with higher order connectedness
  为了进一步的研究，人们提出了各种各样的高阶连通性概念，如super -性， hyper -性，超边连通性， r -限制性边连通度等。本论文主要利用图的高阶连通性研究网络(特别是对称网络)的可靠性。
• Most notably , the parameters called connectivity and line - connectivity have been frequently used . the connectivity of a graph g is the least number of vertices of g whose removal disconnects g similarly , the line - connectivity of g is the least number of g whose removal disconnects g the higher the connectivity ( edge - connectivity ) of g , the more stable it is considered to be
  而这些研究工作主要是围绕点连通度，边连通度，局部点、边连通度来做的，但随着图的连通性研究的不断深入，人们越来越觉得仅用点连通度，边连通度，局部点、边连通度来描述图的连通性存在很大的局限性。
• In the first chapter , the background and some basic results are introduced . in the second chapter , we study higher order edge connectivity , and obtained ( a ) except for three graphs , all infinite circulants with finite jump sequence are super - ; ( b ) except for three classes of graphs , all edge transitive graphs are optimally - ( 3 ) ; ( c ) the optimally - ( 3 ) property is characterized for vertex transitive graphs , in particular , necessary and sufficient conditions are give for cayley graphs to be optimally - ( 3 ) ( d ) a sufficient condition for a graph to be optimally - ( 3 ) is given
  第二章中，我们研究高阶边连通度，得到了如下结果： ( a )除了三个特殊图外，所有具有有限跃阶的无限循环图都是超边连通的； ( b )除了三种特殊图类外，所有边传递图都是最优- ~ ( 3 )图； ( c )刻划了点传递图的最优- ~ ( 3 )性，特别是给出了cayley图和极小cayley图为最优- ~ ( 3 )图的充分必要条件； ( d )给出了一个图(不一定是对称图)是最优- ~ ( 3 )图的一种充分条件。