Exploring a general and effective method of isomorphism identification is an arduous task. For this aim, some new concepts such as binary link path and link-assortment adjacency matrix are introduced in this paper. On this basis, a new method is proposed to improve the operability of isomorphism identification andrelieve the computational pressure. By generating new elements from structural features and connection relations among links or vertices in the graph, it transforms traditional high-ranking adjacency matrix into new low rankingadjacency matrix. Some typical graphs including kinematic chains, topological graphs, and planetary gear trains are used to verify the effectiveness of the proposed method. As shown by a comparison with results in the cited references, the proposed method is available in isomorphism identification.