The spectral characterization of graphs of index less than 2 with no path as a component

Linear Algebra and Its Applications

Volumn 428, Issue 7, 2008, Pages 1696-1705

  Omidi, G R ^a  

^a ISFAHAN UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Cospectral graphs; Spectra of graphs

Indexed keywords

LAPLACE EQUATION; MATRIX ALGEBRA; PROBLEM SOLVING;

COSPECTRAL GRAPHS; SPECTRA OF GRAPHS;

GRAPH THEORY;

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

References (10)

1. Cvetkovic D.M., Doob M., and Sachs H. Spectra of Graphs. third ed. (1995), Johann Abrosius Barth Verlag
2. Cvetkovic D.M., and Gutman I. On spectral structure of graphs having the maximal eigenvalue not greater than two. Publ. Inst. Math. Beograd 18 (1975) 39-45
3. Ghareghani N., Omidi G.R., and Tayfeh-Rezaie B. Spectral characterization of graphs with index at most sqrt(2 + sqrt(5)). Linear Algebra Appl. 420 (2007) 483-489
4. Hoffman A.J., and Smith J.H. On the spectral radii of topological equivalent graphs. In: Fielder M. (Ed). Recent Advances in Graph Theory (1975), Academia Praha, Prague 273-281
5. Li J.S., and Zhang X.D. On the Laplacian eigenvalues of a graph. Linear Algebra Appl. 285 (1998) 305-307
6. Omidi G.R., and Tajbakhsh K. Starlike trees are determined by their Laplacian spectrum. Linear Algebra Appl. 422 (2007) 654-658
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
9. Van Dam E.R., and Haemers W.H. Which graphs are determined by its spectrum?. Linear Algebra Appl. 373 (2003) 241-272
10. Wang W., and Xu C.X. Note: The T-shape tree is determined by its Laplacian spectrum. Linear Algebra Appl. 419 (2006) 78-81