← All problems

Odd-order graphs do not exhibit Laplacian perfect state transfer

3 years old · traced to

Let XX be a simple connected unweighted graph on an odd number of vertices. Odd-order Laplacian PST conjecture. Laplacian perfect state transfer does not occur in XX. This extends the corresponding result for unweighted graphs on 33 or 55 vertices and follows for weighted join graphs under the additional assumption that the characteristic polynomial of the Laplacian has integer coefficients; the general case remains open.

References
  1. Steve Kirkland and Hermie Monterde, “Quantum walks on join graphs”, arXiv:2312.06906 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.