%0 Journal Article
%T On the Spectral Characterization of <i>H</i>-Shape Trees
%A Shengbiao Hu
%J Advances in Linear Algebra & Matrix Theory
%P 79-86
%@ 2165-3348
%D 2014
%I Scientific Research Publishing
%R 10.4236/alamt.2014.42005
%X <div align=\"justify\">
	A graph <em>G</em> is said to be determined by its spectrum if any graph having the same spectrum as <em>G</em> is isomorphic to <em>G</em>. An <em>H</em>-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 <em>H</em>-shape are given.
</div>
%K Spectra of Graphs
%K Cospectral Graphs
%K Spectra Radius
%K &lt
%K i&gt
%K H&lt
%K /i&gt
%K -Shape Trees
%K Determined by Its Spectrum
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=45914