Graphs cospectral with starlike trees

Linear Algebra and Its Applications

Volumn 429, Issue 11-12, 2008, Pages 2691-2701

  Ghareghani, N ^a,b   Ramezani, F ^a,c   Tayfeh Rezaie, B ^a  

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

^b UNIVERSITY OF TEHRAN   (Iran)

^c AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Characteristic polynomials; Cospectral graphs; Starlike trees

Indexed keywords

GRAPH THEORY; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

CHARACTERISTIC POLYNOMIALS; COSPECTRAL GRAPHS; NECESSARY AND SUFFICIENT CONDITIONS; SIMPLE STRUCTURES; SPECTRAL PROPERTIES; STARLIKE TREES;

TREES (MATHEMATICS);

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

References (15)

1. Cvetković D.M., Doob M., and Sachs H. Spectra of Graphs, Theory and applications. third ed. (1995), Johann Ambrosius Barth, Heidelberg
2. van Dam E.R., and Haemers W.H. Which graphs are determined by their spectrum?. Linear Algebra Appl. 373 (2003) 241-272
3. E.R. van Dam, W.H. Haemers, Developments on spectral characterizations of graphs, Discrete Math., in press.
4. Godsil C.D., and McKay B.D. A new graph product and its spectrum. Bull. Austral. Math. Soc. 18 (1978) 21-28
5. Gutman I., Araujo O., and Rada J. Matchings in starlike trees. Appl. Math. Lett. 14 (2001) 843-848
6. Hoffman A.J., and Smith J.H. On the spectral radii of topologically equivalent graphs. Recent advances in graph theory. Proc. Second Czechoslovak Sympos., Prague, 1974 (1975), Academia, Prague 273-281
7. Lepović M. Some results on starlike trees and sunlike graphs. J. Appl. Math. Comput. 11 (2003) 109-123
8. Lepović M., and Gutman I. No starlike trees are cospectral. Discrete Math. 242 (2002) 291-295
9. Lepović M., and Gutman I. Some spectral properties of starlike trees. Bull. Cl. Sci. Math. Nat. Sci. Math. No. 26 (2001) 107-113
10. Omidi G.R., and Tajbakhsh K. Starlike trees are determined by their Laplacian spectrum. Linear Algebra Appl. 422 (2007) 654-658
11. Schwenk A.J. Computing the characteristic polynomial of a graph. Graphs and combinatorics, Proc. Capital Conf., George Washington Univ., Washington, D.C., 1973. Lecture Notes in Math. vol. 406 (1974), Springer, Berlin 153-172
12. Shi L. The spectral radii of a graph and its line graph. Linear Algebra Appl. 422 (2007) 58-66
13. J.H. Smith, Some Properties of the Spectrum of a Graph, 1970 Combinatorial Structures and their Applications, Gordon and Breach, New York, pp. 403-406.
14. Wang W., and Xu C.-X. On the spectral characterization of T-shape trees. Linear Algebra Appl. 414 (2006) 492-501
15. Watanabe M., and Schwenk A.J. Integral starlike trees. J. Austral. Math. Soc. Ser. A 28 (1979) 120-128