Some new bounds for the signless Laplacian energy of a graph
Abstract
For a simple graph G with n vertices, m edges and signless Laplacian eigenvalues q1 ≥ q2 ≥ ·s ≥ qn ≥ 0, its the signless Laplacian energy QE(G) is defined as QE(G) = Σi=1n|qi - d |, where d = 2mn 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.