• 1
  • 1
  • 2
  • 5
  • 6
  • 6
  • 3
  • 4
IPM
30
YEARS OLD

“School of Mathematics”

Back to Papers Home
Back to Papers of School of Mathematics

Paper   IPM / M / 11323
School of Mathematics
  Title:   On integral graphs with few cycles
  Author(s):  G. R. Omidi
  Status:   Published
  Journal: Graphs Combin.
  Year:  2010
  Pages:   DOI 10.1007/s00373-010-0913-1
  Supported by:  IPM
  Abstract:
A graph is called integral if the spectrum of its adjacency matrix has only integer eigenvalues. In this paper, all integral graphs with at most two cycles (trees, unicyclic and bicyclic graphs) with no eigenvalue 0 are identified. Moreover, we give some results on unicyclic integral graphs with exactly one eigenvalue 0.


Download TeX format
back to top
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
scroll left or right