laplacian spectral characterization of setosa graphs

A setosa graph sg(e, f, g, h, d; b1, b2, . . . , bs) is a graph consisting of five cycles and s(≥ 1) paths pb1+1, pb2+1, . . . , pbs+1 intersecting in a single vertex that all meet in one vertex, where bi ≥ 1 (for i = 1, . . . , s) and e, f, g, h, d ≥ 3 denote the length of the cycles ce, cf , cg, ch and cd, respectively. two graphs g and h are l-cospectral if they have the same laplacian spectrum. a graph g is said to be determined by the spectrum of its laplacian matrix (dls, for short) if every graph with the same laplacian spectrum is isomorphic to g. in this paper we prove that if h is a l-cospectral graph with a setosa graph g, then h is also a setosa graph and the degree sequence of g and h are the same. we conjecture that all setosa graphs are dls.