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.
Similar content being viewed by others
References
Brouwer, A.E.: Small integral trees, Electron. J. Combin. 15 (2008)
Cvetkovic D.M., Doob M., Sachs H.: Spectra of graphs. 3rd edn. Johann Abrosius Barth Verlag, Germany (1995)
van Dam E.R., Haemers W.H.: Which graphs are determined by their spectrum?. Linear Algebra Appl. 373, 241–272 (2003)
Watanabe M.: Note on integral trees. Math. Rep. Toyama Univ. 2, 95–100 (1979)
Watanabe M., Schwenk A.J.: Integral starlike trees. J. Austral. Math. Soc. Ser. A 28, 120–128 (1979)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was in part supported by a grant from IPM (No. 88050012).
Rights and permissions
About this article
Cite this article
Omidi, G.R. On Integral Graphs with Few Cycles. Graphs and Combinatorics 25, 841–849 (2009). https://doi.org/10.1007/s00373-010-0913-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-010-0913-1