𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On bicyclic graphs whose second largest eigenvalue does not exceed 1

✍ Scribed by Shu-Guang Guo

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
248 KB
Volume
407
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On graphs whose second largest eigenvalu
On graphs whose second largest eigenvalue does not exceed (√5βˆ’1)2
✍ DragoΕ‘ CvetkoviΔ‡; Slobodan SimiΔ‡ πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 690 KB

It is well known in the theory of graph spectra that connected graphs except for complete multipartite (including complete) graphs have the second largest eigenvalue greater than 0. Graphs whose second largest eigenvalue does not exceed ~ are characterized in . In this paper we study the structure o

On unicyclic graphs whose second largest
On unicyclic graphs whose second largest eigenvalue dose not exceed 1
✍ Guang-Hui Xu πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 219 KB

Connected graphs in which the number of edges equals the number of vertices are called unicyclic graphs. In this paper, all unicyclic graphs whose second largest eigenvalue does not exceed 1 have been determined.