1) inflation
[英][ɪn'fleɪʃn] [美][ɪn'fleʃən]
膨胀图
1.
A graph FG is the inflation of G,if each vertex of G is substituted by a complete graph,and two vertices from two complete graphs respectively which substitute two different vertices u and v are adjacent,if and only if u and v are adjacent.
图G膨胀图是指将G的每一个点都用一个完全图替换,且取代两个不同顶点u和v的完全图上的两点相邻当且仅当u和v是相邻的;若取代每个顶点的完全图都是同阶的,则称此膨胀图为一致的。
2.
F_G is the inflation of G if V(F_G)=V_1∪V_2∪…∪V_n,in such a way that if x∈V_i and y∈V_j,then xy∈E(F_G),if and only if i=j or v_iv_j∈E(G).
设图G的点集V(G)={v1,v2,…,vn},G的膨胀图FG的点集V(FG)=V1∪V2∪…∪Vn,且对x∈Vi,y∈Vj,有xy∈E(FG),当且仅当i=j或vivj∈E(G)。
3.
FGis a inflation ofG if F(FG)=V1∪V2∪…∪Vn,in such a way that ifx∈Viand y∈Vj,then xy∈E(FG), if and only if i = jorvivj∈E(G).
设图G的点集V(G)=(v1,v2,…,vn),Vi是点集(i=1,2,…,n),G的膨胀图FG的点集V (FG)=V1∪V2∪…∪Vn,且对x∈Vi,y∈Vj,有xy∈E(FG),当且仅当i=j或vivj∈E(G)。
2) expander graph
膨胀图
1.
The basic theory of expander graph is introduced in this paper,including the relation between combinatorial expanders and algebraic expanders,the construction technique of expander family and so on.
介绍了膨胀图的基本理论,组合膨胀与代数膨胀之间的联系,以及膨胀器构造方法等。
2.
Expander codes are a kind of linear errorcorrecting codes based on expander graph by which the notation of the expander graph is introduced and it should be an innovation in coding theory.
膨胀码是基于膨胀图所构造的一种线性纠错码。
3.
These properties are used to construct a new expander graph with two known expander graphs.
将矩阵直积的概念引入图论,证明了直积图的结点数、度及特征值分别等于原图结点数之积、度之积和特征值之积,并将这些性质应用于由两个膨胀图构造一个新的膨胀图,分别从矩阵的角度和图的角度给出了构造算法。
3) Image dilation
图像膨胀
4) Color Doppler Power Imaging
持续膨胀量图
5) expansion test chart
膨胀试验图表
6) Expansion
[英][ɪk'spænʃn] [美][ɪk'spænʃən]
膨胀
1.
Physical and Chemical Changes of Tobacco Stem and Stem Granules During Microwave Expansion;
微波膨胀过程中烟梗及由其制备的颗粒的物理化学变化
2.
An experimental study on the expansion mechanism of alkali-silica reaction in concrete;
混凝土中碱-硅反应的膨胀机理研究
3.
Control and Support Technology of Expansion Soft Rock;
离散膨胀性软岩控制及支护技术
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条