Schwenk, A.J. (1973) Almost All Trees Are Cospectral. In: Harary, F., Ed., New Directions in the Theory of Graphs, Academic Press, New York, 275-307.

has been cited by the following article:

• TITLE: On the Spectral Characterization of H-Shape Trees

  AUTHORS: Shengbiao Hu

  KEYWORDS: Spectra of Graphs, Cospectral Graphs, Spectra Radius, H-Shape Trees, Determined by Its Spectrum

  JOURNAL NAME: Advances in Linear Algebra & Matrix Theory, Vol.4 No.2, May 15, 2014

  ABSTRACT: A graph G is said to be determined by its spectrum if any graph having the same spectrum as G is isomorphic to G. An H-shape is a tree with exactly two of its vertices having maximal degree 3. In this paper, a formula of counting the number of closed 6-walks is given on a graph, and some necessary conditions of a graph Γ cospectral to an H-shape are given.