1) nuclear subgraph
核子图
1.
The concept of edge weighted nuclear subgraph is given and it is proved that the number of edge weighted nuclear subgraphs of a graph is edge reconstructible.
定义了图的边型带权核子图 ,证明了图中同构于边型核子图的数目是边可重构的 ,从而给出了关于边重构的新结
2) weighted nuclear subgraph
带权核子图
1.
In this paper,we use the reconstructibility of weighted nuclear subgraphs and it is proved that connected graphs are reconstructible.
本文我们利用带权核子图的可重构性证明了连通图是可重构的,从而证明了重构猜想为真。
3) nuclear log
核子测井图
4) core graph
核图
1.
The paper defined a core graph G_(core) of a graph G and investigated some properties.
定义了一个图的核图并研究了它们的性质,最后给出了关于λ(G)的两个重要定理的简短证明。
5) Nucleon
[英]['nju:kliɔn] [美]['nuklɪɑn]
核子
1.
The interaction between nucleon and Ti meson is calculated with a good result according to equivalent field theory,which is helpful for the us age of interaction picture.
利用量子力学中的相互作用绘景,讨论了轻子-核子深度非弹性散射中,把反冲的物理核子系统的哈密顿量写成H0和H1,而H1并非小量时,用等效场论方法计算核子与介子云系统相互作用的方法,得出较好的结果。
2.
Within the framework of the relativistic Dirac Brueckner approach,the paper constructs two one boson exchange(OBE) interactions,one for nucleons only,the other including Δ degrees of freedom,calculates all t matrices and Δ self energy in the (N,N) and ( N,Δ ) systems in the full momentum spin space,and obtains better results.
在相对论D B近似的框架内 ,构造了两个单玻色子交换OBE(OneBosonExchange)势 ,一个只包含核子 ,另一个还包含Δ自由度 ,在完备的动量—自旋空间中计算了 (N ,N)和 (N ,Δ)系统的所有t矩阵和自能 ,得出了较好的结
3.
In the paper, the isospin agular momentun coupling wave functions of nucleons are constructed by twice unitary transformations between group chains in agular momentun coupling space of neutron proton, the CFPs are factorized as products of three isoscalar factors(ISF) and the ISFs are calculated by using the coupling wave functions.
提出在中子－质子角动量耦合空间，通过群链间二次幺正变换，构造核子同位旋－角动量耦合波函数，并由此计算因子化的亲态比系数（ＣＦＰ）。
6) nucleolus
[英][nju:'kli:ələs] [美][nju'kliələs]
核子
1.
Determination of the weights of ultimate cross efficiency based on the solution of nucleolus;
基于核子解的最终交叉效率权系数确定方法
2.
There are several solution concepts with respectto di?erent rationality, such as core , nucleolus, etc.
根据不同的合理性要求产生了不同的对策解的概念,如核心,核子等等。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
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
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条