Firstly, some problems on factorizations in complete graphs are studied.
完全图的因子分解问题。
Moreover, we determine the toughness of the product of two complete graphs.
还给出了两个完全图乘积的坚韧度。
The minimum sets of complete graphs are obtained respectively for 8-site neighborhood and 4-site neighborhood digital images.
对于八近邻和四近邻的图像，分别建立了一组最小的完备图。
The minimum sets of complete graphs are obtained respectively for 4-site neighborhood digital images.
对于四近邻的图像，建立了一组最小的完备图。
The minimum sets of complete graphs are obtained respectively for 4-site neighborhood digital images.
对于四近邻的图像，建立了一组最小的完备图。
应用推荐