𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On unicyclic graphs whose second largest eigenvalue dose not exceed 1

✍ Scribed by Guang-Hui Xu

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
219 KB
Volume
136
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ 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