| 直径为n-4谱半径第二小的连通图 |
| |
| 引用本文： | 姜静静,吴晓丽,谭尚旺,郭继明.直径为n-4谱半径第二小的连通图[J].广西科学,2011,18(2):105-109. |
| |
| 作者姓名： | 姜静静 吴晓丽 谭尚旺 郭继明 |
| |
| 作者单位： | 中国石油大学数学与计算科学学院,山东东营,257061 |
| |
| 摘 要： | 采用图形变换和比较图的特征项式等方法,按照图的最小谱半径对具有固定直径和顶点数的图类定序,确定了顶点数为n直径为n-4谱半径是第二小的连通图.
|
| 关 键 词： | 连通图 树 谱半径 直径 特征多项式 |
| 收稿时间： | 2010/9/10 0:00:00 |
| 修稿时间： | 2010/12/13 0:00:00 |
The Connected Graphs of Diameter n-4 with the Second Smallest Spectral Radius |
| |
| JIANG Jing-jing,WU Xiao-li,TAN Shang-wang and GUO Ji-ming.The Connected Graphs of Diameter n-4 with the Second Smallest Spectral Radius[J].Guangxi Sciences,2011,18(2):105-109. |
| |
| Authors: | JIANG Jing-jing WU Xiao-li TAN Shang-wang and GUO Ji-ming |
| |
| Institution: | (Department of Mathematics,China University of Petroleum,Dongying,Shandong,257061,China) |
| |
| 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. |
| |
| Keywords: | connected graphs tree spectral radius diameter characteristic polynomial |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《广西科学》浏览原始摘要信息 |
| 点击此处可从《广西科学》下载免费的PDF全文 |
