AbstractFor a graph G and a real number α≠0, the graph invariant sα(G) is the sum of the αth power of the non-zero Laplacian eigenvalues of G. In this note, we obtain some bounds of sα(G) for a connected bipartite graph G, which improve some known results of Zhou [B. Zhou, On sum of powers of the Laplacian eigenvalues of graphs, Linear Algebra Appl. 429 (2008) 2239-2246]
AbstractFor a connected graph G of order n⩾2 with positive Laplacian eigenvalues λ2,…,λn, letb(G)=n−...
For a graph G and a real number a, the graph invariant s? (G) is the sum of the ath powers of the si...
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless ...
AbstractFor a graph G and a real α≠0, we study the graph invariant sα(G) – the sum of the αth power ...
AbstractFor a graph G and a real number α≠0, the graph invariant sα(G) is the sum of the αth power o...
summary:For a bipartite graph $G$ and a non-zero real $\alpha $, we give bounds for the sum of the...
Let G be a graph of order n with signless Laplacian eigenvalues q(1),...,q(n) and Laplacian eigenval...
For a simple and connected graph, a new graph invariant s(G), defined as the sum of alpha-powers of ...
AbstractLet G be a graph with n vertices and e(G) edges, and let μ1(G)⩾μ2(G)⩾⋯⩾μn(G)=0 be the Laplac...
For a given a simple connected graph, we present some new bounds via a new approach for a special to...
summary:Let $G$ be an undirected connected graph with $n$, $n\ge 3$, vertices and $m$ edges with Lap...
A well known upper bound for the spectral radius of a graph, due to Hong, is that μ21≤2m-n+1 if δ≥1....
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of lapl...
AbstractFor a graph G and a real number α≠0, the graph invariant sα(G) is the sum of the αth power o...
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Lapl...
AbstractFor a connected graph G of order n⩾2 with positive Laplacian eigenvalues λ2,…,λn, letb(G)=n−...
For a graph G and a real number a, the graph invariant s? (G) is the sum of the ath powers of the si...
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless ...
AbstractFor a graph G and a real α≠0, we study the graph invariant sα(G) – the sum of the αth power ...
AbstractFor a graph G and a real number α≠0, the graph invariant sα(G) is the sum of the αth power o...
summary:For a bipartite graph $G$ and a non-zero real $\alpha $, we give bounds for the sum of the...
Let G be a graph of order n with signless Laplacian eigenvalues q(1),...,q(n) and Laplacian eigenval...
For a simple and connected graph, a new graph invariant s(G), defined as the sum of alpha-powers of ...
AbstractLet G be a graph with n vertices and e(G) edges, and let μ1(G)⩾μ2(G)⩾⋯⩾μn(G)=0 be the Laplac...
For a given a simple connected graph, we present some new bounds via a new approach for a special to...
summary:Let $G$ be an undirected connected graph with $n$, $n\ge 3$, vertices and $m$ edges with Lap...
A well known upper bound for the spectral radius of a graph, due to Hong, is that μ21≤2m-n+1 if δ≥1....
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of lapl...
AbstractFor a graph G and a real number α≠0, the graph invariant sα(G) is the sum of the αth power o...
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Lapl...
AbstractFor a connected graph G of order n⩾2 with positive Laplacian eigenvalues λ2,…,λn, letb(G)=n−...
For a graph G and a real number a, the graph invariant s? (G) is the sum of the ath powers of the si...
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless ...
DOI
Add to ORKG