Maximizing Spectral Radius of Trees with Given Maximal Degree  被引量:1

Maximizing Spectral Radius of Trees with Given Maximal Degree

在线阅读下载全文

作  者:FAN Yi Zheng ZHU Min 

机构地区:[1]Key Laboratory of Intelligent Computing & Signal Processing, Ministry of Education of the People's Republic of China, Anhui University, Anhui 230039, China [2]School of Mathematical Sciences, Anhui University, Anhui 230039, China

出  处:《Journal of Mathematical Research and Exposition》2009年第5期806-812,共7页数学研究与评论(英文版)

基  金:Foundation item: the National Natural Science Foundation of China (No. 10601001); the Natural Science Foundation of Anhui Province (Nos. 050460102; 070412065); Natural Science Foundation of Department of Education of Anhui Province (No. 2005kj005zd); Project of Anhui University on leading Researchers Construction; Foundation of Innovation Team on Basic Mathematics of Anhui University.

摘  要:In this paper, we characterize the trees with the largest Laplacian and adjacency spectral radii among all trees with fixed number of vertices and fixed maximal degree, respectively.In this paper, we characterize the trees with the largest Laplacian and adjacency spectral radii among all trees with fixed number of vertices and fixed maximal degree, respectively.

关 键 词:trees maximal degree Laplacian eigenvalue adjacency eigenvalue spectral radius. 

分 类 号:O157.5[理学—数学] F275[理学—基础数学]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象