Through similar transformation of matrix,this paper discusses the power of matrix and its related content.

Relationship between the ionization energy and eigenvalue of adjacent matrix for helicene;

Isomorphism judgement of kinematic chains using adjacent matrix method;

Judgement criterion of graph connectivity based on adjacent matrix;

Research on Algorithm of Public Transit Transfer under the Adjacency Matrix;

Separating coupling node area from distribution network based on adjacency matrix;

New topological sort algorithm based on adjacency matrix;

In this paper,lower bounds on the spectral radius of adjacency matrices of trees and perfect trees are discussed by algebraic method and edge switching of graph,and all trees which reach lower bounds on the spectral radius are obtained.

Let be an association scheme with class d,and A0,A1,…,Ad and k0,k1 …,kd be adjacency matrices and valencies of,respectively.

A topological algorism of tearing technology for large scale network analysis is provided,by use of adjoining matrix method,the optimized results,which the tearing branchs are minimum,may guaranteed.

By building the adjoining matrix, confirming the start-point of searching,vectorizing the searching sides,calculating the direction factor of adjoining sides,we can search out the next side of the least loop or the most loop rapidly.

According to the orbit of adjoining matrix of directed graph the problem of Hamiltonian cycle is described.