论文部分内容阅读
For a simple connected graph G, let A(G) and Q(G) be the adjacency matrix and signless Laplacian matrix, respectively of G. The principal eigenvector of A(G)(resp.Q(G)) is the unit positive eigenvector corresponding to the largest eigenvalue of A(G)(resp.