On the Spectral Characterization of <i>H</i>-Shape Trees  

作　　者：Shengbiao Hu 

机构地区：[1]Department of Mathematics, Qinghai Nationalities University, Xining, China

出　　处：《Advances in Linear Algebra & Matrix Theory》2014年第2期79-86,共8页线性代数与矩阵理论研究进展（英文）

摘　　要：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.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.

关 键 词：SPECTRA of GRAPHS Cospectral GRAPHS SPECTRA RADIUS H-SHAPE Trees Determined by Its SPECTRUM 

分 类 号：O1[理学—数学]