广西科学2011，Vol.18Issue(2)：105-109,5.
直径为n-4谱半径第二小的连通图
The Connected Graphs of Diameter n-4 with the Second Smallest Spectral Radius
摘要
Abstract
Using graphical transformation and comparison of the characteristic polynomial of graph and other methods, the graphs with the fixed diameter and the vertices number are ordered according to the minimal spectral radius. The connected graphs with the vertices number and the diameter that have the second smallest spectral radius are determined.关键词
连通图/树/谱半径/直径/特征多项式Key words
connected graphs/ tree/ spectral radius/ diameter/ characteristic polynomial分类
数理科学引用本文复制引用
姜静静,吴晓丽,谭尚旺,郭继明..直径为n-4谱半径第二小的连通图[J].广西科学,2011,18(2):105-109,5.基金项目
国家自然科学基金项目(10871204)资助. （10871204）
