×

More about singular line graphs of trees. (English) Zbl 1121.05073

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.

MSC:

05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
PDFBibTeX XMLCite
Full Text: DOI EuDML