1) edge transitive graphs
边传递图
1.
In chapter 3, we studythe super-restricted edge connectedness of edge transitive graphs, and mainlycharacterize super-λ\'connected edge transitive graphs.
第三章,研究了边传递图的超限制边连通性问题,主要结果是刻画了超限制边连通的边传递图。
2) weakly edge-transitive graph
弱边传递图
3) transmitting boundary
传递边界
1.
In order to reduce the effect of wave reflecting on artificial boundary,transmitting boundary and semi-infinite elements are respectively used to treat the lateral and underside boundary.
基于动力学基本方程,运用有限单元法(FEM)和NEWMARK隐式积分方法,对动荷载(FWD荷载)作用下路基下伏黄土暗穴动力稳定的临界埋深进行了弹塑性数值分析,考虑到人工截断边界上波反射对计算结果的影响,分别用传递边界和半无限单元来处理侧面和底面边界。
2.
In order to reduce the effect of wave reflecting on artificial boundary,transmitting boundary and semi-infinite element are respectively used to treat the lateral and underside boundaries.
考虑到人工截断边界上波反射对计算结果的影响,分别用传递边界和半无限单元来处理侧面和底面边界。
4) edge-transitive
边传递
1.
ThenΓis G-edge-transitive if and only ifΓis one of following graphs: 1)p~mK_1,p~(n-1-m),0≤m≤n-1; 2)P~mK_1,p~(n-m),0≤m≤n; 3)p~mK_p,p~(n-m-1),0≤m≤n-2; 4)p~(n-m)C_p~m,p~.
如果G在Γ的边集合上传递,则称Γ是G-边传递图。
2.
Secondly,we give a sufficient condition for the cyclic optimality of vertex- or edgetransitive graphs,that is:any connectedκ-regular vertex-transitive graph with k≥4 and girth at least five is cyclically optimal;any connected edge-transitive graph with minimum degree at least four and order at least six is cyclically optimal.
本论文分别给出点传递图和边传递图是最优圈边连通的一种充分条件,即:任意一个连通κ-正则点传递图若满足κ≥4且围长g≥5,则它是最优圈边连通图;任意最小度δ(G)≥4且点数n≥6的边传递图是最优圈边连通图。
5) (G-)edge-transtive
(G-)边传递
6) recursive edge graph
递归边图
补充资料：弱弱联合
弱弱联合是指两个总体实力都不强但都拥有自己独特的某方面优势的企业之间进行联合，以形成较强的实力。弱弱联合，弱企业之间优势互补，可以形成整体实力变强的效应。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条