Papers
Topics
Authors
Recent
Search
2000 character limit reached

Some new bounds for the signless Laplacian energy of a graph

Published 7 Oct 2020 in math.CO | (2010.03980v1)

Abstract: For a simple graph $G$ with $n$ vertices, $m$ edges and signless Laplacian eigenvalues $q_{1} \geq q_{2} \geq \cdots \geq q_{n} \geq 0$, its the signless Laplacian energy $QE(G)$ is defined as $QE(G) = \sum_{i=1}{n}|q_{i} - \bar{d} |$, where $\bar{d} = \frac{2m}{n}$ is the average vertex degree of $G$. In this paper, we obtain two lower bounds ( see Theorem 3.1 and Theorem 3.2 ) and one upper bound for $QE(G)$ ( see Theorem 3.3 ), which improve some known bounds of $QE(G)$, and moreover, we determine the corresponding extremal graphs that achieve our bounds. By subproduct, we also get some bounds for $QE(G)$ of regular graph $G$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.