论文信息 - On the Largest Eigenvalue of Unicyclic Graphs

On the Largest Eigenvalue of Unicyclic Graphs

We rst establish some relations between the graph structure and its largest eigenvalue. Applying these results to unicyclic graphs (with a xed number of points), we explain some facts about the 1-ordering of these graphs. Most of these facts were suggested by the experiments conducted on the expert system "GRAPH", which has been developed and implemented at the Faculty of Electrical Engineering, University of Belgrade.

Slobodan K. Simić | S. Simic

[1] Frank Harary,et al. Graph Theory , 2016 .

[2] B. Parlett. The Symmetric Eigenvalue Problem , 1981 .

[3] Dragos Cvetkovic,et al. Spectra of unicyclic graphs , 1987, Graphs Comb..

[4] A. Schwenk. COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A GRAPH. , 1974 .

[5] Dragos Cvetkovic,et al. A table of connected graphs on six vertices , 1984, Discret. Math..

[6] L. Lovász,et al. On the eigenvalues of trees , 1973 .