摘要
赋权图的谱经常用来解决网络和电路设计中的问题.本文主要研究有固定点数和正的权集合的赋权圈的无号拉普拉斯谱半径,并找出其中无号拉普拉斯谱半径最大的圈.
The spectrum of weighted graphsare often used to solve the problems in the design of networks and electronic circuits.In the paper we determine the weighted cycles with the signless Laplacian matrix in the set of all weighted cycles with order n and positive weight set.
出处
《安阳师范学院学报》
2010年第5期29-32,共4页
Journal of Anyang Normal University