烟台大学学报（自然科学与工程版）2011，Vol.24Issue(1)：6-9,4.
双圈图的Laplacian谱展
The Laplacian Spread of Bicyclic Graphs
摘要
Abstract
Let G be a simple connected graph. The matrix L( G) =D( G) -A( G) is called the Laplacian ma trix of G, where D( G) is the degree diagonal matrix while A( G) is the adjacency matrix of G. The Laplacian spread of a connected graph G is the difference between the largest and second smallest eigenvalue of L( G). A connected graph is bicyclic if its size equals to its order plus one. The Laplacian spread of bicyclic graphs is studied and the extremal graphs with the maximal Laplacian spread are determined.关键词
双圈图/Laplacian 特征值/Laplacian谱展分类
数理科学引用本文复制引用
林西芹..双圈图的Laplacian谱展[J].烟台大学学报（自然科学与工程版）,2011,24(1):6-9,4.基金项目
国家自然科学基金资助项目(10871205) （10871205）
山东省自然科学基金资助项目(Y2008A04). （Y2008A04）
