说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 整图
1)  integral graph
整图
1.
We say that G is integral graph if its spectrum consists entirely of integers.
如果G的谱完全由整数组成,我们就说G是整图
2.
We have obtained two calculation formulas of the characteristic polynomial of some graphs and some results of an integral graph.
推出几类图的特征多项式的计算公式,得到整图的一些结果。
3.
We survey the reduction formula of characteristic polynomial of Regular M-crossing Tree and obtain which Regular M-crossing Tree become the Integral Graph condition.
本文主要是研究正则m-叉树特征多项式的递推公式,并通过其递推公式来得出正则m-叉树成为整图的条件。
2)  graphs/integral sum graph
图/整和图
3)  complete pole figure
完整极图
1.
From this an investigation has been made on the textures development in the alloy during cold rolling and subsequent recrystallization annealing by means of ODF determined from only one complete pole figure by the maximum entropy method(MEM) proposed by authors.
因此,根据作者于1994年提出的从一张完整极图计算ODF的最大熵技术,测算了2091铝锂合金,在冷轧和退火过程中织构变化。
4)  synthetic map
整合图
1.
Objective: To separate the low abundance protein and establish the 2-DE synthetic map of total protein of human normal spermatozoa by using the 2-DE technology.
目的:运用二维电泳(2-DE)技术分离人类正常精子低丰度蛋白并建立全精子蛋白的2-DE整合图。
5)  integral sum graph
整和图
1.
This paper gives upper palm leaf of sum number of palm leaf fanT_n and proves that bajiao fanT_n is integral sum graph and mod integral sum graph.
给出了芭蕉扇Tn和数的上界,并证明了芭蕉扇Tn是整和图,模整和图。
2.
This paper mainly proves the following results: 1) let G be a graph of order n, if δ(G)≥(n+3)/2,then G is not integral sum graph.
证明了 :(1)对任意n阶图G ,若δ(G)≥ (n +3) 2 ,则G不是整和图 。
6)  mod integral sum graph
模整和图
1.
This paper gives upper palm leaf of sum number of palm leaf fanT_n and proves that bajiao fanT_n is integral sum graph and mod integral sum graph.
给出了芭蕉扇Tn和数的上界,并证明了芭蕉扇Tn是整和图,模整和图。
2.
This paper proves that the windmill W_n~* is the integral sum graph and mod integral sum graph.
证明了风车Wn*(n≥2)是整和图,模整和图。
补充资料:图的减缩图(或称图子式)


图的减缩图(或称图子式)
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
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条