Let G be a graph of order n with signless Laplacian eigenvalues q(1),...,q(n) and Laplacian eigenvalues mu(1),...,mu(n). It is proved that for any real number alpha with 0 = mu(alpha)(1) + ... + mu(alpha)(n) holds, and for any real number beta with 1 < beta < 2, the inequality q(1)(beta) + ... + q(n)(beta) <= mu(beta)(1) + ... + mu(beta)(n) holds. In both inequalities, the equality is attained (for alpha is not an element of {1,2}) if and only if G is bipartite.X118sciescopu
For a simple and connected graph, a new graph invariant s(G), defined as the sum of alpha-powers of ...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
summary:For a simple graph $G$ on $n$ vertices and an integer $k$ with $1\leq k\leq n$, denote by $\...
summary:For a bipartite graph $G$ and a non-zero real $\alpha $, we give bounds for the sum of the...
AbstractFor a graph G and a real number α≠0, the graph invariant sα(G) is the sum of the αth power o...
AbstractFor a graph G and a real α≠0, we study the graph invariant sα(G) – the sum of the αth power ...
summary:Let $G$ be an undirected connected graph with $n$, $n\ge 3$, vertices and $m$ edges with Lap...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractFor a graph G and a real number α≠0, the graph invariant sα(G) is the sum of the αth power o...
AbstractLet G be a graph with n vertices and e(G) edges, and let μ1(G)⩾μ2(G)⩾⋯⩾μn(G)=0 be the Laplac...
Let p(G)p(G) and q(G)q(G) be the number of pendant vertices and quasi-pendant vertices of a simple u...
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Lapl...
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of lapl...
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless ...
summary:Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We ...
For a simple and connected graph, a new graph invariant s(G), defined as the sum of alpha-powers of ...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
summary:For a simple graph $G$ on $n$ vertices and an integer $k$ with $1\leq k\leq n$, denote by $\...
summary:For a bipartite graph $G$ and a non-zero real $\alpha $, we give bounds for the sum of the...
AbstractFor a graph G and a real number α≠0, the graph invariant sα(G) is the sum of the αth power o...
AbstractFor a graph G and a real α≠0, we study the graph invariant sα(G) – the sum of the αth power ...
summary:Let $G$ be an undirected connected graph with $n$, $n\ge 3$, vertices and $m$ edges with Lap...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractFor a graph G and a real number α≠0, the graph invariant sα(G) is the sum of the αth power o...
AbstractLet G be a graph with n vertices and e(G) edges, and let μ1(G)⩾μ2(G)⩾⋯⩾μn(G)=0 be the Laplac...
Let p(G)p(G) and q(G)q(G) be the number of pendant vertices and quasi-pendant vertices of a simple u...
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Lapl...
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of lapl...
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless ...
summary:Let $G$ be a connected graph of order $n$ and $U$ a unicyclic graph with the same order. We ...
For a simple and connected graph, a new graph invariant s(G), defined as the sum of alpha-powers of ...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
summary:For a simple graph $G$ on $n$ vertices and an integer $k$ with $1\leq k\leq n$, denote by $\...