面对满足二维空间邻接条件的聚类问题，定义了邻接矩阵的概念。
In order to dealing with the clustering considering the condition of planar adjacency relationship, the concept adjacency matrix is defined.
本文把它转化为增加限制条件的指派问题，对图邻接矩阵矩形对角进行分析，给出了这一问题的一个较好近似算法。
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.
本文给出了三种类型的自补图关于直径方面的结果，并从自补图的邻接矩阵给出了自补图直径为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.
最后，在恰当的假设条件下，获得了弱扰动映射的二阶邻接导数的上半连续和下半连续性。
Finally, under suitable assumptions, we obtain the upper semicontinuity and the lower semicontinuity of second-order adjacent derivatives for the weak perturbation maps.
根据提出的约束条件，采取逐级构造杆组邻接矩阵方法，求解杆组间的可行连接方式，并同步辨识同构体，从而获取全R副杆组间的连接关系的杆组邻接矩阵。
The connection forms of all R joints of the Assur groups in the assembly forms are permutated step by step following the proposed connection constrains and isomorphism is detected in the process.
根据提出的约束条件，采取逐级构造杆组邻接矩阵方法，求解杆组间的可行连接方式，并同步辨识同构体，从而获取全R副杆组间的连接关系的杆组邻接矩阵。
The connection forms of all R joints of the Assur groups in the assembly forms are permutated step by step following the proposed connection constrains and isomorphism is detected in the process.
应用推荐