Abstract
We impose some restrictions on the spectra of a threshold graph, allowing us to compute its Laplacian energy. We then show that the pineapple with clique number 1+⌊2n3⌋ has largest Laplacian energy among all pineapples with n vertices and among all the graphs satisfying those conditions. We also find large families of threshold graphs that satisfy those restrictions and exhibit pairs of such graphs with the same Laplacian energy and different Laplacian spectra. We show by computation that the above pineapple has maximum Laplacian energy among all connected threshold graphs for all n<35.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
