On the Largest Eigenvalue of Unicyclic Graphs
Publications de l'Institut Mathématique, _N_S_42 (1987) no. 56, p. 13
We first establish some relations between the graph
structure and its largest eigenvalue. Applying these results to
unicyclic graphs (with a fixed number of points), we explain some facts
about the $\lambda_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.
Classification :
05C50
@article{PIM_1987_N_S_42_56_a1,
author = {Slobodan K. Simi\'c},
title = {On the {Largest} {Eigenvalue} of {Unicyclic} {Graphs}},
journal = {Publications de l'Institut Math\'ematique},
pages = {13 },
year = {1987},
volume = {_N_S_42},
number = {56},
language = {en},
url = {http://geodesic.mathdoc.fr/item/PIM_1987_N_S_42_56_a1/}
}
Slobodan K. Simić. On the Largest Eigenvalue of Unicyclic Graphs. Publications de l'Institut Mathématique, _N_S_42 (1987) no. 56, p. 13 . http://geodesic.mathdoc.fr/item/PIM_1987_N_S_42_56_a1/