Characterizing trees with large Laplacian energy

DOI10.1016/J.LAA.2013.01.028zbMATH Open1282.05029arXiv1205.6487OpenAlexW2089734791MaRDI QIDQ2437344FDOQ2437344

Authors: Eliseu Fritscher, Carlos Hoppen, Israel Rocha, Vilmar Trevisan 

Publication date: 3 March 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: We investigate the problem of ordering trees according to their Laplacian energy. More precisely, given a positive integer $n$, we find a class of cardinality approximately $sqrtn$ whose elements are the $n$-vertex trees with largest Laplacian energy. The main tool for establishing this result is a new upper bound on the sum $S_k(T)$ of the $k$ largest Laplacian eigenvalues of an $n$-vertex tree $T$ with diameter at least four, where $kin1,\mathrm{...},n$.

Full work available at URL: https://arxiv.org/abs/1205.6487

Recommendations

• On the sum of the Laplacian eigenvalues of a tree
• Ordering trees with \(n\)-vertices and diameter \(d\) by their largest Laplacian eigenvalues
• Laplacian energy of diameter 3 trees
• On the sum of the two largest Laplacian eigenvalues of trees
• Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues

zbMATH Keywords

Laplacian eigenvaluesLaplacian energyordering trees

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05)

Cites Work

• Spectra of graphs
• On a conjecture for the sum of Laplacian eigenvalues
• On the sum of the Laplacian eigenvalues of a tree
• Upper bounds for the sum of Laplacian eigenvalues of graphs
• Ordering trees by their largest eigenvalues
• Trees with the seven smallest and eight greatest Harary indices
• Ordering graphs with index in the interval \((2, \sqrt{2+\sqrt 5})\)
• On the sum of Laplacian eigenvalues of graphs
• Recent results in the theory of graph spectra
• Laplacian energy of a graph
• Old and new results on algebraic connectivity of graphs
• Laplacian energy of diameter 3 trees
• Locating the eigenvalues of trees
• Randić ordering of chemical trees
• Ordering of the trees with a perfect matching by minimal energies
• Ordering of trees with fixed matching number by the Laplacian coefficients
• On the minimal energy ordering of trees with perfect matchings
• Spectra of weighted generalized Bethe trees joined at the root
• An Extremum Property of Sums of Eigenvalues
• Ordering graphs with small index and its application
• Title not available (Why is that?)
• Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues
• Ordering trees by their Laplacian spectral radii

Cited In (17)

• Ordering trees with \(n\)-vertices and diameter \(d\) by their largest Laplacian eigenvalues
• On the sum of the Laplacian eigenvalues of a graph and Brouwer's conjecture
• On the Laplacian eigenvalues of a graph and Laplacian energy
• Signless Laplacian energy of a graph and energy of a line graph
• On Laplacian energy in terms of graph invariants
• Maximum Laplacian energy of unicyclic graphs
• Maximality of the signless Laplacian energy
• More trees with large energy
• On the sum of the Laplacian eigenvalues of a tree
• Bounding the sum of the largest Laplacian eigenvalues of graphs
• Locating Eigenvalues of Symmetric Matrices - A Survey
• On Laplacian energy of graphs
• Absolute algebraic connectivity of double brooms and trees
• On Laplacian like energy of trees
• Note on an upper bound for sum of the Laplacian eigenvalues of a graph
• Ordering trees and graphs with few cycles by algebraic connectivity
• Laplacian energy of diameter 3 trees

This page was built for publication: Characterizing trees with large Laplacian energy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437344)