排序方式: 共有49条查询结果,搜索用时 15 毫秒
1.
蕴含W5可图序列的最小度和 总被引:2,自引:0,他引:2
Gould,Jacobson和Lehel考虑了下述经典Tur偄n型极值问题的变形:对于给定的图H,确定最小的正偶数σ(H,n),使得对于每一个n项可图序列π=(d1,d2,…,dn),当σ(π)=d1+d2+…+dn≥σ(H,n)时,π有一个实现G包含H作为可图的.本文确定了当n≥11时,σ(W5,n)之值,其中Wr是r个顶点的轮图. 相似文献
2.
Summary Apart from cancer and mutation induction, radiobiological effects on mammals are mostly attributable to cell death, defined as loss of proliferative capacity. Survival curves relate retention of that capacity to radiation dose, and often manifest a quasi-threshold (shoulder). The shoulder is attributable to an initial mechanism of repair (Q-repair) which is gradually depleted as dose increases. Another form of repair, which is not depleted (P-repair), increases the dose required to deliver an average of one lethal event per cell (dose D0). Neither form of repair can unambiguously be linked with repair of defects in isolated DNA. An important initial lesion may well be disruption of the complex structural relationship between the DNA, nuclear membrane and associated proteins. One form of P-repair may be restoration of that structural relationship. 相似文献
3.
本文对相对正规性,可弱连续嵌入以及潜在紧空间等几个相对拓扑性质进行了初步研究,分别给出了正规空间在更大的拓扑空间中正规的条件和Tychonoff空间可弱连续嵌入到更大的Tychonoff空间的条件.同时证明了拓扑空间的潜在紧性是拓扑不变量。 相似文献
4.
5.
设σ(3Cl,n)是具有下述性质的最小正偶数,每个项和至少为σ(3Cl,n)的n项可图序列π都有一个实现含有长为3,4,…,l的圈.本文首先给出了σ(3Cl,n)的下界,并确定了当4l6且nl时σ(3Cl,n)的值. 相似文献
6.
采用构造性方法证明了蕴含Ar+1^(m)-可图序列刻划定理. 相似文献
7.
设A为n阶符号模式,如果对任意n次首1实系数多项式r(x),都有一个实矩阵B在符号模式A的定性矩阵类Q(Α)中,且B的特征多项式为f(x)=r(x),则称A是谱任意的.如果A是谱任意的并且A的真子模式都不是谱任意的,则称A为极小谱任意的.文章对一类新的含有2n个非零元的n阶符号模式运用幂零——雅可比方法证明了其为极小谱任意模式. 相似文献
8.
The non-orthogonal localized molecular orbital(NOLMO)is the most localized representation of electronic degrees of freedom.As such,NOLMOs are thus potentially the most efficient for linear scaling calculations of electronic structures for large systems.However,direct ab initio calculations with NOLMO have not been fully implemented and widely used,partly because of the slow convergence issue in the optimization of NOLMO.We devel- 相似文献
9.
对于给定的图H,称π是蕴含H可图的,如果π有一个实现包含H作为子图.K k,C k,Pk分别表示k阶完全图,圈长为k的圈和路长为k的路.本文刻划了当n≥6时,蕴含(K 4-e)+K3的可图序列,其中,(K 4-e)+K3如下图所示. 相似文献
10.
对于给定图Г,称可图序列π=(d1,d2,…,dn)是蕴含Г-可图的,若存在π的一个实现以Г为其子图.本文刻划了蕴含H的可图序列,其中H为剖分完全图K4的相邻两条边所得到的剖分图. 相似文献