signless laplacian spectral determinations of some multicone graphs

If a clique and a regular graph are joined together the resulting graph is called a multicone graph. a graph g is said to be determined by the spectrum of its signless laplacian matrix (dqs, for short) if every graph with the same laplacian spectrum is isomorphic to g. it is proved that all the multicone graphs kr ▽ skt, except for kr ▽ 3k1, are dqs, where kr denots a complete graph with r ≥ 1 vertices. consequently, by using these results we give a response to an open problem in [24].