Title of article
On unicyclic graphs whose second largest eigenvalue dose not exceed 1 Original Research Article
Author/Authors
Guang-Hui Xu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
8
From page
117
To page
124
Abstract
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.
Keywords
Eigenvalue , Induced subgraph , Unicyclic graph
Journal title
Discrete Applied Mathematics
Serial Year
2004
Journal title
Discrete Applied Mathematics
Record number
885790
Link To Document