图的特征值交错方法的几个应用.pdfVIP

Journal of Mathematical Research Exposition May, 2008, Vol.28, No.2, pp.251–256 DOI:10.3770/j.issn:1000-341X.2008.02.002 Http:// Some Applications on the Method of Eigenvalue Interlacing for Graphs LI Jian Xi1,2, CHANG An1 (1. Department of Mathematics, Fuzhou University, Fujian 350002, China; 2. Department of Mathematics, Hong Kong Baptist University, Hong Kong, China) (E-mail: anchang@) Abstract The Method of Eigenvalue Interlacing for Graphs is used to investigate some problems on graphs, such as the lower bounds for the spectral radius of graphs. In this paper, two new sharp lower bounds on the spectral radius of graphs are obtained, and a relation between the Laplacian spectral radius of a graph and the number of quadrangles in the graph is deduced. Keywords eigenvalues interlacing; adjacency matrix; Laplace matrix; quotient matrix. Document code A MR(2000) Subject Classification 05C05; 05C50 Chinese Library Classification O157.5 1. Introduction In this paper, we consider only finite graphs without multiple edges and loops[1]. Let G be a graph with vertex set V (G) = {v , v , . . . , v } and edge set E (G) = {e , e , . . . , e }. Its 1 2 n 1 2 m adjacency matrix A(G) = (aij ) is defined to be the n × n matrix (aij ), where 1, (v , v ) ∈ E (G), i j aij = 0, otherwise. The characteristic polynomial of G is just det(λI − A(G)), which is denoted by P (G; λ). S