Spectral characterization of graphs with index at most sqrt(2 + sqrt(5))

Linear Algebra and Its Applications

Volumn 420, Issue 2-3, 2007, Pages 483-489

  Ghareghani, N ^a,b   Omidi, G R ^a,c   Tayfeh Rezaie, B ^a  

^a INSTITUTE FOR STUDIES IN THEORETICAL PHYSICS AND MATHEMATICS IPM   (Iran)

^b UNIVERSITY OF TEHRAN   (Iran)

^c ISFAHAN UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Adjacency spectrum; DS graphs; Index; Spectral characterization

Indexed keywords

INDEXING (OF INFORMATION); LINEAR ALGEBRA; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

ADJACENCY SPECTRUM; DS GRAPHS; INDEX; SPECTRAL CHARACTERIZATION;

GRAPH THEORY;

EID: 33750993774     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2006.08.009     Document Type: Article

References (10)

1. Brouwer A.E., and Neumaier A. The graphs with spectral radius between 2 and sqrt(2 + sqrt(5)). Linear Algebra Appl. 114/115 (1989) 273-276
2. Cvetković D.M., Doob M., and Gutman I. On graphs whose spectral radius does not exceed (2 + sqrt(5)) 1 / 2. Ars Combin. 14 (1982) 225-239
3. Cvetković D.M., Doob M., and Sachs H. Spectra of Graphs, Theory and Applications. third ed. (1995), Johann Ambrosius Barth, Heidelberg
4. van Dam E.R., and Haemers W.H. Which graphs are determined by their spectrum?. Linear Algebra Appl. 373 (2003) 241-272
5. newGRAP. Available from: .
6. Schwenk A.J. Almost all trees are cospectral. In: Harary F. (Ed). New Directions in the Theory of Graphs (1973), Academic Press, New York 275-307
7. n are determined by their spectrum. Linear Algebra Appl. 404 (2005) 58-68
8. Smith J.H. Some properties of the spectrum of a graph. Combinatorial Structures and their Applications (1970), Gordon and Breach, New York pp. 403-406
9. Wang W., and Xu C.-X. On the spectral characterization of T-shape trees. Linear Algebra Appl. 414 (2006) 492-501
10. R. Woo, A. Neumaier, On graphs whose spectral radius is bounded by 3 sqrt(2) / 2, preprint.