| 给定阶及边独立数和圈数的图的谱半径 |
| |
| 引用本文： | 谭尚旺,张德龙,亓键. 给定阶及边独立数和圈数的图的谱半径[J]. 工程数学学报, 2007, 24(2): 334-342 |
| |
| 作者姓名： | 谭尚旺 张德龙 亓键 |
| |
| 作者单位： | 石油大学数学系,东营,257061;广西工学院信息与计算科学系,柳州,545006 |
| |
| 摘 要： | 令U(n,i,r)表示阶是n、边独立数是i和圈数是r的简单连通图的集合,这里图的任意两个圈至多有一个公共顶点。当i≥r 1时,对任意的G∈U(n,i,r),得到了G的谱半径的精确上界和达到上界的所有极图。这一结果推广了树、单圈图和双圈图谱半径的许多已有结论。
|
| 关 键 词： | 生成子图 对集 谱半径 |
| 文章编号： | 1005-3085(2007)02-0334-09 |
| 修稿时间： | 2004-09-28 |
The Spectral Radius of Graphs with Given Order, Edge Independence Number and Cycle Number |
| |
| TAN Shang-wang,ZHANG De-long,QI Jian. The Spectral Radius of Graphs with Given Order, Edge Independence Number and Cycle Number[J]. Chinese Journal of Engineering Mathematics, 2007, 24(2): 334-342 |
| |
| Authors: | TAN Shang-wang ZHANG De-long QI Jian |
| |
| Affiliation: | 1- Dept of Mathematics, Petroleum University, Dongying 257061; 2- Dept of Information and Computing Science, Guangxi Institute of Technology, Liuzhou 545006 |
| |
| Abstract: | Let U(n, i, r) be the set of simple and connected graphs with order n, edge independence number i and cycle number r in which arbitrary two cycles have at most a common vertex. We obtain the upper bound for spectral radius of graphs in U(n, i,r) (i > r 1) and give all such graphs that their spectral radius reach the upper bounds. These results generalize many ones on the spectral radius of trees, unicyclic graphs and bicyclic graphs. |
| |
| Keywords: | spanning subgraph matching spectral radius |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
