Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6416618 | Linear Algebra and its Applications | 2008 | 21 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Hong-Hai Li, Bit-Shun Tam, Li Su,