特别地，当D是某正整数集合，Z是整数集时，得出了整数距离图G（Z ，D）的点荫度的几个上界。

In particular, some upper bounds of the vertex arboricity of the integer distance graph G(Z, D) are obtained when D is a set of positive integers and Z the set of all integers.

youdao

为了获得强大的稳定性和更低的区间矩阵的容错系统，保证成本的方法确定最小上界的实对称矩阵集。

To obtain robust stability and lower guaranteed cost of interval matrix fault tolerant systems, a method of determining the minimum upper bound of the real symmetric matrix set is proposed.

youdao