| 两类图的谱半径 |
| |
| 引用本文： | 谭尚旺.两类图的谱半径[J].中国石油大学学报(自然科学版),2004,28(2). |
| |
| 作者姓名： | 谭尚旺 |
| |
| 作者单位： | 石油大学数学与计算科学学院,山东东营,257061 |
| |
| 摘 要： | 得到了有k个圈且边独立数为k的一类连通图的谱半径的上界 ,且给出了达到上界的所有极图 ,同时给出了给定阶和边独立数的树的谱半径结论的一个新的证明。所得结论对进一步研究给定阶、边独立数和圈数的一般图的谱半径有重要的作用
|
| 关 键 词： | 生成子图 对集 谱半径 |
Spectral radius of two types of graphs |
| |
| TAN Shang-wang. College of Mathematics and Computation Science in the University of Petroleum,China,Dongying.Spectral radius of two types of graphs[J].Journal of China University of Petroleum,2004,28(2). |
| |
| Authors: | TAN Shang-wang College of Mathematics and Computation Science in the University of Petroleum China Dongying |
| |
| Institution: | TAN Shang-wang. College of Mathematics and Computation Science in the University of Petroleum,China,Dongying 257061 |
| |
| Abstract: | The upper bound of spectral radius of the graphs with edge independence number k and cycle number k was obtained. All extreme graphs which have reached the upper bound were given. There exists at most a common vertex between any two cycles of the graphs. A new proof of an obtained result about the spectral radius of a tree with the given order and edge independence number was given. The proof plays an important role in investigating the spectral radius of a connected graph with the given order, edge independence number and cycle number. |
| |
| Keywords: | spanning subgraph matching spectral radius |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
