A sandglass graph is a graph obtained by appending a triangle to each pendant vertex of a path. This paper shows that a sandglass graph adding an edge at one of the vertex of a triangle is determined by its adjacency spectrum.
关键词
Keywords
references
Cvetkovi′c D,Doob M,Sachs H.Spectra of Graphs-Theory and Applications[M].Heidelberg:Leipzig,1995.
Bang S,Dam E,Koolen J.Spectral characterizations of the Hamming graphs[J].Linear Algebra Appl,2008,429:2678-2686.
Omidi G.On a Laplacian spectral characterization of graphs of index less than 2[J].Linear Algebra and its Applications,2008,429:2724-2731.
Hoffman A,Smith J.On the spectral radii of topologically equivalent graphs[J].Recent Advances in Graph Theory,Academia Praha,1975:273-281.
Schwenk A.Computing the characteristic polynomial of a graph Graphs[J].Combin Notes Math,1974,406:153-172.
Ghareghani N,Omidi G,Tayfeh-Rezaie B,Spectral characterization of graphs with index at most2+√5[J].Linear Algebra and its Applications,2007,420:483-489.