کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6416618 1336835 2008 21 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the signless Laplacian coefficients of unicyclic graphs
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
On the signless Laplacian coefficients of unicyclic graphs
چکیده انگلیسی

Let G be a graph of order n and let QG(x)=∑i=0n(−1)ipi(G)xn−i be the characteristic polynomial of the signless Laplacian of G. Let Eg,n (respectively, Cg(Sn−g+1)) denote the unicyclic graph of order n obtained by a coalescence of a vertex in the cycle Cg with an end vertex (respectively, the center) of the path Pn−g+1 (respectively, the star Sn−g+1). It is proved that for k=2,…,n−1, as G varies over all unicyclic graphs of order n, depending on k and n, the maximum value of pk(G) is attained at G=Cn or E3,n, and the minimum value is attained uniquely at G=C4(Sn−3) or C3(Sn−2). Except for the resolution of a conjecture on cubic polynomials, the uniqueness issue for the maximization problem is also settled.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 439, Issue 7, 1 October 2013, Pages 2008-2028
نویسندگان
, , ,