On the smallest eigenvalues of the line graphs of some trees
classification
🧮 math.CO
cs.DM
keywords
graphsfamilylinesmallesttreesbethecharacteristiccomplete
read the original abstract
In this paper, we study the characteristic polynomials of the line graphs of generalized Bethe trees. We give an infinite family of such graphs sharing the same smallest eigenvalue. Our family generalizes the family of coronas of complete graphs discovered by Cvetkovi\'c and Stevanovi\'c.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.