| 给定边连通度的图的最小距离谱半径(英文) |
| |
| 引用本文： | 李小新,范益政,汪毅.给定边连通度的图的最小距离谱半径(英文)[J].数学杂志,2014,34(4):671-678. |
| |
| 作者姓名： | 李小新 范益政 汪毅 |
| |
| 作者单位： | 池州学院数学与计算机科学系, 安徽 池州 247000;安徽大学数学科学学院, 安徽 合肥 230601,安徽大学数学科学学院, 安徽 合肥 230601,安徽大学数学科学学院, 安徽 合肥 230601 |
| |
| 基金项目： | Supported by National Natural Science Foundation of China (11071002);Program for New Century Excellent Talents in University,Key Project of Chinese Ministry of Education (210091);Natural Science Research Foundation of Department of Education of Anhui Province (KJ2013A196). |
| |
| 摘 要： | 本文研究了边连通度为r的n阶连通图中距离谱半径最小的极图问题,利用组合的方法,确定了K(n-1,r)为唯一的极图,其中K(n-1,r)是由完全图K_(n-1)添加一个顶点v以及连接v与K_(n-1)中r个顶点的边所构成.上述结论推广了极图理论中的相关结果.
|
| 关 键 词： | 图 距离矩阵 谱半径 边连通度 |
| 收稿时间： | 2013/4/13 0:00:00 |
| 修稿时间： | 2013/6/13 0:00:00 |
MINIMUM DISTANCE SPECTRAL RADIUS OF GRAPHS WITH GIVEN EDGE CONNECTIVITY |
| |
| LI Xiao-xin,FAN Yi-zheng and WANG Yi.MINIMUM DISTANCE SPECTRAL RADIUS OF GRAPHS WITH GIVEN EDGE CONNECTIVITY[J].Journal of Mathematics,2014,34(4):671-678. |
| |
| Authors: | LI Xiao-xin FAN Yi-zheng and WANG Yi |
| |
| Institution: | Department of Mathematics and Computer Sciences, Chizhou University, Chizhou 247000, China;School of Mathematical Sciences, Anhui University, Hefei 230601, China,School of Mathematical Sciences, Anhui University, Hefei 230601, China and School of Mathematical Sciences, Anhui University, Hefei 230601, China |
| |
| Abstract: | In this paper we study the extremal graphs with minimum distance spectral radius among all connected graphs of order n and edge connectivity r.By using the combinatorial method,we determine that K(n-1,r) is the unique extremal graph,where K(n-1,r) is obtained from the complete graph Kn-1 by adding a vertex v together with edges joining v to r vertices of Kn-1.All the above generalize the related results of the extremal graph theory. |
| |
| Keywords: | graph distance matrix spectral radius edge connectivity |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《数学杂志》浏览原始摘要信息 |
| 点击此处可从《数学杂志》下载免费的PDF全文 |
|
