کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4949733 | 1440204 | 2017 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The changes in distance Laplacian spectral radius of graphs resulting from graft transformations
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
For a connected graph G, the distance Laplacian spectral radius of G is the spectral radius of its distance Laplacian matrix L(G) defined as L(G)=Tr(G)âD(G), where Tr(G) is a diagonal matrix of vertex transmissions of G and D(G) is the distance matrix of G. In this paper, we study the change in the distance Laplacian spectral radius of graphs by some graft transformations, and as applications, we determine the unique graphs with minimum distance Laplacian spectral radius among non-caterpillar trees, and among non-starlike non-caterpillar trees, respectively, we prove that the path is the unique graph with maximum distance Laplacian spectral radius among connected graphs, and determine the unique graph with maximum distance Laplacian spectral radius among connected graphs with given clique number.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 219, 11 March 2017, Pages 147-157
Journal: Discrete Applied Mathematics - Volume 219, 11 March 2017, Pages 147-157
نویسندگان
Hongying Lin, Bo Zhou,