1) betti deficiency number
Betti亏数
1.
Improvement of a result on the Betti deficiency number of graphs;
关于Betti亏数的一个结果的改进
2) Betti deficiency
Betti亏数
1.
Spanning Trees, Basic Cycles and Betti Deficiency of a Graph;
图的生成树,基本圈与Betti亏数
2.
It is known that the maximum genus of a graph is mainly determined by its Betti deficiency ξ(G) .
一个连通图G的最大亏格γM(G)主要由它的Betti亏数 ξ(G)确定。
3.
The maximum genus of a connected graph is determined by its Betti deficiency.
一个连通图G的最大亏格γM(G)可由其Betti亏数ξ(G)确定。
3) Betti number
Betti数
1.
Curvature and Betti Numbers;
曲率与Betti数(英文)
2.
It is indicated that the lower bounds relative to Betti numbers are not accurate and the method is not appropriate.
关于这些泛函给出对于双球环的下界以及达到这些下界的相应子流形 ,并且证明前文 (四川师范大学学报 (自然科学版 ) ,2 0 0 0 ,2 3(4 ) :32 9)对于管状超曲面所得的有关Betti数的下界估计是不精确的 ,进而说明了Willmore型泛函寻求以子流形的拓扑不变量为下确界似乎是不可能的 ,并给出类似Willmore猜测的一些猜测 。
3.
Some characterizations are also presented on Betti numbers and relations between a graph and its matching complex.
研究了M(G)的一些性质 ,如M(G)的Betti数 ,和图G的关系等 。
4) graded Betti number
分次Betti数
1.
Elementary automorphisms and graded Betti numbers;
初等自同构和分次Betti数(英文)
2.
Therefore P and / have the same graded Betti numbers,projective dimension and regularity.
当I(?)S为无平方强稳定理想时I~c=I，因而I~c和I的分次Betti数、投射维数和正则度相同，本文主要研究I为无平方稳定理想时，I~c和I之间分次Betti数的关系。
6) Betti deficiency
亏数
1.
Abstract Combined with the edge-connectivity of graphs, this paper gives an upperbound of Betti deficiency on a graph in terms of chromatic number of its complement, provesthat this bound is the best possible, and obtains some new results on the lower bounds of themaximum genus of graphs.
结合边连通性,本文给出了一个图的Ｂｅｔｔｉ亏数由这个图的补图的着色数所确定的上界式,证明了所给出的上界式是最好的,得到关于图的最大亏格下界的若干新结果。
补充资料：无亏
1.没有欠缺;没有损害。 2.不输;不差。 3.没有减少或损失。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条