Signless-Laplacian determination conjecture for multicone cycle graphs
Signless-Laplacian determination conjecture for multicone cycle graphs
Let be the complete graph on vertices, let be the cycle graph on vertices, and let denote the disjoint union of copies of . Write for the join of graphs and . A graph is DS with respect to its signless Laplacian spectrum if every graph with the same signless Laplacian spectrum is isomorphic to it. Signless-Laplacian multicone conjecture. The multicone graphs are DS with respect to their signless Laplacian spectra. The paper proves adjacency- and Laplacian-spectral determination for connected multicone graphs of this form, but leaves the signless-Laplacian assertion as a conjecture.
Sources & referencesView supporting material
Primary source
Ali Zeydi Abdian, “The spectral determinations of the multicone graphs Kw+mCn”, arXiv:1703.08728 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.