کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4648620 1342421 2010 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the Laplacian spectral radius of weighted trees with a positive weight set
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
On the Laplacian spectral radius of weighted trees with a positive weight set
چکیده انگلیسی

The spectrum of weighted graphs is often used to solve the problems in the design of networks and electronic circuits. We first give some perturbational results on the (signless) Laplacian spectral radius of weighted graphs when some weights of edges are modified; we then determine the weighted tree with the largest Laplacian spectral radius in the set of all weighted trees with a fixed number of pendant vertices and a positive weight set. Furthermore, we also derive the weighted trees with the largest Laplacian spectral radius in the set of all weighted trees with a fixed positive weight set and independence number, matching number or total independence number.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 310, Issue 5, 6 March 2010, Pages 1026–1036
نویسندگان
,