检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者: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.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.8