Spectra of unicyclic graphs (Q1091400): Difference between revisions

We study lexicographic ordering of unicyclic graphs by spectral moments as well as the ordering by the largest eigenvalue. If the length of the cycle is fixed, extremal graphs in the first ordering are obtained by attaching a star and a path to a cycle. For the other ordering minimal graphs are not known. A table of the 89 unicyclic graphs on 8 vertices with their spectra is appended.