| 1. | Thus the value of the function at any grid point is the average of its values at the immediately neighboring points .
因此，任一结点上的函数值就等于其直接邻点上函数值的平均。 |
| 2. | Interpolation ; voronoi cells ; natural neighors
插值voronoi cells自然邻点 |
| 3. | Adjacent - vertex - distinguishing total chromatic numbers of k2n 1 - e 2k
的邻点可区别全色数 |
| 4. | On adjacent vertex - distinguishing total colorings of graphs pm 215 ; pn
的邻点可区别全染色 |
| 5. | The adjacent vertex - distinguishing total coloring of special graphs
几类特殊图的邻点可区别全染色 |
| 6. | On adjacent vertex - distinguishing total coloring of three special graphs
三类特殊图的邻点可区别全染色 |
| 7. | Some new results on the adjacent vertex - distinguishing total coloring of graphs
关于邻点可区别全染色的几个新结果 |
| 8. | A note on the upper bound of adjacent vertex distinguishing chromatic number of graphs
关于图邻点可区别上界的一点注 |
| 9. | We obtain the adjacent - vertex distinguishing total chromatic numbers with the first moment principle , markov ' s inequality and some kinds of lovasz local lemma , respectively
) sz局部引理分别得到了任一最大度为d的图g的邻点可区别的全色数。 |
| 10. | Markov ' s inequality and some kinds of lovasz local lemma , respectively . in the last part , we discuss a new concept " adjacent - vertex distinguishing total colorings "
第四部分引入了邻点可区别的全染色这一新的概念，并用第一矩量原理， markov不等式以及几种形式的lov ( |
