Line graphs of trees with the largest eigenvalue multiplicity

From MaRDI portal





Given a tree \(T\) with \(p\geq 3\) pendant edges, the authors prove that the multiplicity of any eigenvalue of the line graph of \(T\) is less than \(p\). In addition, the line graphs for which there is an eigenvalue with multiplicity \(p-1\) are fully characterized.



Cites work









This page was built for publication: Line graphs of trees with the largest eigenvalue multiplicity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178770)