Marino, M. C.; Sciriha, I.; Simić, S. K.; Tošić, D. V. More about singular line graphs of trees. (English) Zbl 1121.05073 Publ. Inst. Math., Nouv. Sér. 79(93), 1-12 (2006). A graph is called singular if its spectrum contains eigenvalue 0. The authors study trees whose line graphs are singular (LS trees). They show that connecting two LS trees by an edge results again in an LS tree. Many related theoretical and computational results as well as new proofs of old results are given. Reviewer: Dragoš Cvetković (Beograd) Cited in 10 Documents MSC: 05C50 Graphs and linear algebra (matrices, eigenvalues, etc.) Keywords:graph spectra; line graph; singular graph PDFBibTeX XMLCite \textit{M. C. Marino} et al., Publ. Inst. Math., Nouv. Sér. 79(93), 1--12 (2006; Zbl 1121.05073) Full Text: DOI EuDML