Some Applications on the Method of Eigenvalue Interlacing for Graphs
Received:February 22, 2006  Revised:July 06, 2006
Key Words: eigenvalues interlacing   adjacency matrix   Laplace matrix   quotient matrix.  
Fund Project:the National Natural Science Foundation of China (No.10431020); the Natural Science Foundation of Fujian Province (No.Z0511016).
Author NameAffiliation
LI Jian Xi Department of Mathematics, Fuzhou University, Fujian 350002, China
Department of Mathematics, Hong Kong Baptist University, Hong Kong, China 
CHANG An Department of Mathematics, Fuzhou University, Fujian 350002, China 
Hits: 3048
Download times: 3087
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.
Citation:
DOI:10.3770/j.issn:1000-341X.2008.02.002
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.