Trees with Four and Five Distinct Signless Laplacian Eigenvalues

DOI10.22342/jims.25.3.557.302-313zbMath1451.05149OpenAlexW2993013592MaRDI QIDQ5141993

Fatemeh Taghvaee, Gholam Hossein Fath-Tabar

Publication date: 29 December 2020

Published in: Journal of the Indonesian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22342/jims.25.3.557.302-313

zbMATH Keywords

treeeigenvaluesignless Laplacian matrixsemi-edge walk

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs with four distinct Laplacian eigenvalues
• Spectra of graphs
• Signless Laplacians of finite graphs
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Graphs with three distinct eigenvalues and largest eigenvalue less than 8
• Multiplicative cones - a family of three eigenvalue graphs
• Regular graphs with four eigenvalues
• On maximum signless Laplacian Estrada index of graphs with given parameters
• A note on graphs whose signless Laplacian has three distinct eigenvalues
• Notes on graphs with least eigenvalue at least -2
• Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
• Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
• On the skew spectral moments of graphs
• The Spectrum of the Corona of Two Graphs

This page was built for publication: Trees with Four and Five Distinct Signless Laplacian Eigenvalues