| 引用本文： |
-
姜静静,吴晓丽,谭尚旺,郭继明.直径为n-4谱半径第二小的连通图[J].广西科学,2011,18(2):105-109. [点击复制]
- JIANG Jing-jing,WU Xiao-li,TAN Shang-wang,GUO Ji-ming.The Connected Graphs of Diameter n-4 with the Second Smallest Spectral Radius[J].Guangxi Sciences,2011,18(2):105-109. [点击复制]
|
|
| 摘要: |
| 采用图形变换和比较图的特征项式等方法,按照图的最小谱半径对具有固定直径和顶点数的图类定序,确定了顶点数为n直径为n-4谱半径是第二小的连通图. |
| 关键词: 连通图 树 谱半径 直径 特征多项式 |
| DOI： |
| 投稿时间：2010-09-10修订日期：2010-12-13 |
| 基金项目:国家自然科学基金项目(10871204)资助 |
|
| The Connected Graphs of Diameter n-4 with the Second Smallest Spectral Radius |
|
JIANG Jing-jing, WU Xiao-li, TAN Shang-wang, GUO Ji-ming
|
| (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. |
| Key words: connected graphs tree spectral radius diameter characteristic polynomial |
