面对满足二维空间邻接条件的聚类问题，定义了邻接矩阵的概念。

In order to dealing with the clustering considering the condition of planar adjacency relationship, the concept adjacency matrix is defined.

youdao

本文把它转化为增加限制条件的指派问题，对图邻接矩阵矩形对角进行分析，给出了这一问题的一个较好近似算法。

After turning it into a Designate Problem and analyzing the opposite angles of a rectangle in the Adjacency Matrix about its figure, this paper gives an approximate algorithm about it.

youdao

本文给出了三种类型的自补图关于直径方面的结果，并从自补图的邻接矩阵给出了自补图直径为2或3的一个充要条件。

In this paper, we get the diameter of three kind of self-complementary and then give a necessary and sufficient condition from matrix adjacency when the diameter is 2 or 3.

youdao