图实现的成对分解方法

Decomposing Method in Pair of Graph realization

在Ｍａｙｅｄａ 的由矩阵实现为图的方法中，当存在多个Ｈ 子矩阵时形成一对Ｍ 子矩阵较困难，对此，该文研究了连通块的连接性质，提出了利用连通块的邻接概念对Ｈ 子矩阵进行分类判断，解决了在各种情况下一对 Ｍ 子矩阵的形成问题。该文又提出了图实现的成对分解法，它不但具有Ｍａｙｅｄａ 方法的优点，而且适用性和实用性更强，简便有效。

In Mayeda's method from matrix to graph, there is a difficulty in forming a pair M submatrix, with many H submatrixs. For this reason, connection properties of connected block is studied in this paper. The adjacency concept of connected block mentioned here is used to do the classified judgement of H submatrixes, thus solving the formation of a pair M submatrix in various cases. Decomposing method in pair of graph-realization is also presented. The method has both advantages of Mayeda's method and more adaptable,practicable,convenient and effective.