The sum of the first two largest signless Laplacian eigenvalues of trees and unicyclic graphs
نویسندگان
چکیده
منابع مشابه
The Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
متن کاملSome remarks on the sum of the inverse values of the normalized signless Laplacian eigenvalues of graphs
Let G=(V,E), $V={v_1,v_2,ldots,v_n}$, be a simple connected graph with $%n$ vertices, $m$ edges and a sequence of vertex degrees $d_1geqd_2geqcdotsgeq d_n>0$, $d_i=d(v_i)$. Let ${A}=(a_{ij})_{ntimes n}$ and ${%D}=mathrm{diag }(d_1,d_2,ldots , d_n)$ be the adjacency and the diagonaldegree matrix of $G$, respectively. Denote by ${mathcal{L}^+}(G)={D}^{-1/2}(D+A) {D}^{-1/2}$ the normalized signles...
متن کاملOn Sum of Powers of the Laplacian and Signless Laplacian Eigenvalues of Graphs
Let G be a graph of order n with signless Laplacian eigenvalues q1, . . . , qn and Laplacian eigenvalues μ1, . . . , μn. It is proved that for any real number α with 0 < α 6 1 or 2 6 α < 3, the inequality qα 1 + · · · + qα n > μ1 + · · · + μn holds, and for any real number β with 1 < β < 2, the inequality q 1 + · · ·+ q n 6 μβ1 + · · ·+ μ β n holds. In both inequalities, the equality is attaine...
متن کاملSignless Laplacian eigenvalues and circumference of graphs
In this paper, we investigate the relation between the Q -spectrum and the structure of G in terms of the circumference of G. Exploiting this relation, we give a novel necessary condition for a graph to be Hamiltonian by means of its Q -spectrum. We also determine the graphs with exactly one or two Q -eigenvalues greater than or equal to 2 and obtain all minimal forbidden subgraphs and maximal ...
متن کاملOrdering of the signless Laplacian spectral radii of unicyclic graphs
For n ≥ 11, we determine all the unicyclic graphs on n vertices whose signless Laplacian spectral radius is at least n− 2. There are exactly sixteen such graphs and they are ordered according to their signless Laplacian spectral radii.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Linear Algebra
سال: 2019
ISSN: 1081-3810
DOI: 10.13001/1081-3810.3405