Article ID Journal Published Year Pages File Type
9498266 Linear Algebra and its Applications 2005 10 Pages PDF
Abstract
Connected graphs in which the number of edges equals the number of vertices plus one are called bicyclic graphs. In this paper, all bicyclic graphs whose second largest eigenvalue does not exceed 1 have been determined.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Algebra and Number Theory
Preview
On bicyclic graphs whose second largest eigenvalue does not exceed 1
Authors
,