Title of article :
On bicyclic graphs whose second largest eigenvalue does not exceed 1 Original Research Article
Author/Authors :
Shu-Guang Guo، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2005
Pages :
10
From page :
201
To page :
210
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 :
eigenvalue , Induced subgraph , bicyclic graphs
Journal title :
Linear Algebra and its Applications
Serial Year :
2005
Journal title :
Linear Algebra and its Applications
Record number :
824940
Link To Document :
بازگشت