THE SPECTRAL CHARACTERIZATION OF GRAPHS OF INDEX LESS THAN 2WHICH DOES NOT HAVE ANY PATH AS A COMPONENT

A graph is said to be determined by the adjacency (Laplacian) spectrum if there is no other nonisomorphic graph with the same adjacency spectrum. All cinnected graphs are known to be determined by their adjecency spectrum. In this paper, we focus on the problem of spectral characterization of graphs of index less than 2 and we give many infinite families of cospectral graphs with respect to the adjacency matrix. Moreover we give many infinite families of graphs which are determined by their spectrum with respect to the adjacency matrix as well as the Laplacian matrix.

کلیدواژه ها:

Spectra of graphs ، Cospectrsl graphs