赋权树的邻接谱半径  

The Adjacent Spectral Radius Of Weighted Tree

作　　者：李飞祥[1] 姚艳红[1] 

机构地区：[1]安阳师范学院数学与统计学院,河南安阳455002

出　　处：《安阳师范学院学报》2011年第2期1-3,共3页Journal of Anyang Normal University

摘　　要：赋权图的谱常常用来解决网络和电路设计中的问题.本文主要研究有固定的正权集合的赋权树的邻接谱半径与独立数、匹配数、覆盖数、边覆盖数之间的关系,并确定具有最大邻接谱半径的赋权树.The srectral of weighted graphs are often used to solve the problems in the design of networks and electronic circuits.In the paper we study the relationships between the adjacent spectral radius of weighted trees which have fixed positive weight set and the independence number,matching number,covering number,then determine the weighted tree with the largest adjacent spectral radius.

关 键 词：赋权图 赋权树 邻接谱半径 

分 类 号：O157.5[理学—数学]