On the Largest Eigenvalue of Bicyclic Graphs
Publications de l'Institut Mathématique, _N_S_46 (1989) no. 60, p. 1
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
Among bicyclic graphs (connected graphs with two independent
cycles) we find those graphs whose largest eigenvalue (index, for
short) is minimal.
Classification :
05C05
Slobodan K. Simić. On the Largest Eigenvalue of Bicyclic Graphs. Publications de l'Institut Mathématique, _N_S_46 (1989) no. 60, p. 1 . http://geodesic.mathdoc.fr/item/PIM_1989_N_S_46_60_a0/
@article{PIM_1989_N_S_46_60_a0,
author = {Slobodan K. Simi\'c},
title = {On the {Largest} {Eigenvalue} of {Bicyclic} {Graphs}},
journal = {Publications de l'Institut Math\'ematique},
pages = {1 },
year = {1989},
volume = {_N_S_46},
number = {60},
language = {en},
url = {http://geodesic.mathdoc.fr/item/PIM_1989_N_S_46_60_a0/}
}