Determining some graph joins by the signless Laplacian spectrum

Abstract

A graph is determined by its signless Laplacian spectrum if there is no other non-isomorphic graph sharing the same signless Laplacian spectrum. Let $C_l$, $P_l$, $K_l$ and $K_{s,l-s}$ be the cycle, the path, the complete graph and the complete bipartite graph with $l$ vertices, respectively. We prove that $$G\cong K_1\vee (C_{l_1}\cup C_{l_2}\cup \cdots \cup C_{l_t}\cup s{K}_1),$$ with $s\ge 0,t\ge 1,n\ge 22$, is determined by the signless Laplacian spectrum if and only if either $s=0$ or $s\ge 1$ and $l_i\ne 3$ holds for all $1\le i\le t$, where $n$ is the order of $G$, and $\cup$ and $\vee$ stand for the disjoint union and the join of two graphs, respectively. Moreover, for $s\ge 1$ and $l_t=3$, $K_1\vee (K_{1,3}\cup C_{l_1}\cup C_{l_2}\cup \cdots \cup C_{l_{t-1}}\cup (s-1)K_1)$ is fixed as a graph sharing the signless Laplacian spectrum with $G$. This contribution extends some recently published results.

This paper has been submitted and has received two positive anonymous review reports