| 1. | Upper embeddability of a kind of special graph
一类特殊图的上可嵌入性 |
| 2. | So it is very significant to study the embeddability of algebra systems
从而研究代数系统的可嵌入性是非常有意义的。 |
| 3. | This paper mainly discusses the embeddability of several kinds of important algebra systems
本文的目的正是研究几类重要的代数系统的可嵌入性问题。 |
| 4. | While , the determination of a graph ' s upper embeddablity is to determine a graph ' s maximum genus
而确定一类图的上可嵌入性问题本身就是确定图的最大亏格问题。 |
| 5. | On the basis of this , this paper gives a necessary and sufficient condition for an lfi algebra being embedded into the product of a system of linearly ordered fi algebras
事实上，关于lfi代数的这一方法完全可“平移”到讨论剩余格的可嵌入性问题上。进而还指出了具有可嵌入性的lfi代数的性质。 |
| 6. | Mapping a small topology into a large one is an important problem for designing efficient networks . in [ 681 . ibe authors have shown how to map abstract rings of even lengths and meshes into
网络的可嵌入性是衡量网络注能好坏的一个重要标准，因此如何将一个较小的网络嵌入到大的网络中去成为网络设计中需要考虑的一个重要问题 |
| 7. | However , the embeddability plays an important role in proving the completeness of the formal deductive systems . when an algebra system has embeddability . a formula is a tautology for each linearly ordered algebra if and only if it is a tautology for each algebra
在可嵌入性的保证下，当一个公式对所有的某种线性代数系统是重言式时，其必定对所有的同种代数系统是重言式。 |
| 8. | The second part discusses the properties of residuated lattices satisfying ; gives a necessary and sufficient condition w . r . t . residuated lattices . by means of it , this paper obtains several kinds of important algebra systems such as r0 algebras , mv algebras , bl algebras , and wnm algebras have embeddability ; discusses the relation between lfi algebras and residuated lattices ; gives a necessary and sufficient condition for clfi algebras becoming residuated lattices
第二章：讨论了满足( * )式的剩余格的一些性质；找到了剩余格可嵌入于全序剩余格乘积的充要条件；利用这个结果，得到了几类重要代数系统像r _ 0代数、 mv代数、 bl代数、 wnm代数、蕴涵格等等具有可嵌入性；还讨论了lfi代数与剩余格的关系，给出了clfi代数成为剩余格的充要条件。 |
| 9. | Combining one or more parameters of a graph , many papers either present some upper embeddable graphs ~ [ 7 - 14 ] that is to say , they present the graphs , whose maximum genus reaches the best upper bound , or , they give a better low bound on the maximum genus of some graphs ~ [ 15 - 31 ] the first major result of this paper is that : combining vertex partition and degree of vertices of graphs , to study the upper embeddablity of graphs
结合图的一个或多个参数，许多文献都给出了若干上可嵌入图类，即给出了最大亏格达到最好上界[ ( g ) 2 ]的图类；或给出一些图类的最大亏格的较好下界。本文的第一个主要结果，根据图的顶点划分和点的度的条件，研究图的上可嵌入性。 |
