单圈图的Q-谱半径.pdfVIP

Æ Æ Æ ℄ ℄2008 4 25 () ℄ 2008 4 25 ℄ 2008 4 25 230039 ( Q− ) Q− ℄ Æ Q− Æ Q− (1) Q− Æ(2) Æ Q− Æ Q− Q− Æ Q− Q− ℄ Æ Q− : Q− I ABSTRACT The main problem in algebraic graph theory is to discuss whether and how the strcuture of a graph be characterized by the algebraic property of a related matrix of the graph. Here the algebraic property of a matrix mainly means the spectral property. In general the related matrices of a graph are adjacency matrix, incidence matrix, Laplaican matrix, signless Laplacian matrix (also called Q−matrix), etc.. In the past research work, the adjacency matrix and the Laplacian matrix have received much attention, and have a lot of interesting results. The Q−matrix of a graph receives litte attention in the past, but is a hot topic now for researchers in spectral graph theory. As the Q−spectrum of a non- bipartite graph has an essential difference to the Laplacian spectrum of the graph, Q−spectrum plays a different role in reflecti