
doi: 10.1007/bf01788525
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.
Extremal problems in graph theory, unicyclic graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), extremal graphs, spectral moments, ordering, largest eigenvalue
Extremal problems in graph theory, unicyclic graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), extremal graphs, spectral moments, ordering, largest eigenvalue
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 42 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
