%0 Journal Article
%T On Graphs Whose Second Largest Eigenvalue Is Less Than 1<br>第二大根小于1的简单图
%A Xu Guanghui
%A <br>徐光辉
%J 系统科学与数学
%D 2006
%I 
%X Let $G$ be a simple graph with $n$ vertices, and let$\lambda_1(G)\geq\lambda_2(G)\geq\cdots\geq\lambda_n(G)$ be the eigenvalues of theadjacency matrix of $G$. We call $\lambda_2(G)$ the second largest eigenvalue of $G$.In this paper, all the non-bipartite graphs with girth $g\geq4$ and all thebipartite graphswhose second largest eigenvalue is less than 1 have been determined.
%K Graph
%K eigenvalue
%K bipartite graph
%K girth<br>图
%K 特征根
%K 偶图
%K 围长
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=6F686A1CB8E5DC7C&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=CA4FD0336C81A37A&sid=CDEBD1ACE0A4C1C1&eid=1F199509C0B6C4D6&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=13