| 1. | a clique of a simple graph α is a subset s of ν.
简单图的一个团是指中的一个子集s。 |
| 2. | All graphs considered in this paper are simple
本文所考虑的图均为简单图。 |
| 3. | All graphs considered in this paper are finite , undirected and simple
本文仅讨论有限，无向，简单图 |
| 4. | A sufficient condition to decide a simple graph with a complete subgraph
简单图含有完全子图的一个充分条件 |
| 5. | Let g be a finite simple graph
G是有限简单图。 |
| 6. | Let g be a simple graph
G是有限简单图。 |
| 7. | The graphs which we consider here are finite , undirected , simple and loopless
这里考虑的图是有限的、无向的、无圈的简单图。 |
| 8. | In this paper , we establish some relations between the eigenvalues and matching number , diameter , and the number of quasi - pendant vertices of mixed graphs , which extend some known result of simple graphs on eigenvalues distribution
建立了混和图的特征值与匹配数、直径以及拟悬挂点数的关系,推广了简单图上若干关于特征值分布的结论 |
| 9. | There are seventeen graphs and each graph has six points and seven edges . firstly kang qingde and tian zihong have completed two graphs that we can see in [ 7 ] . secondly i have completed three graphs that we can see in [ 8 ]
六点七边图(不带孤立点的简单图)共有17个图，首先在文章[ 7 ]中康庆德和田子红解决了两个图g _ 1和g _ 2 ，然后在文章[ 8 ]中我解决了三个图g _ 3 ， g _ 4和g _ 5 。 |
| 10. | Let a graph g is a simple graph of order n . a graph of order n is called pancyclic if it contains cycles of every length l , 3 < l < n , and is called weakly pancyclic if it contains cycles of all lengths between its girth and circumference
设g是n阶简单图，如果对于任意的整数l ： 3 l n ， g中含有长度为l的圈，则称g为泛圈图；如果g中含有长度在围长和周长之间的所有圈，则称g是弱泛圈图。 |
