Papers
Topics
Authors
Recent
Search
2000 character limit reached

Laplacian pair state transfer in Q-graph

Published 19 Jul 2024 in math.CO | (2407.14376v1)

Abstract: In 2018, Chen and Godsil proposed the concept of Laplacian perfect pair state transfer which is a brilliant generalization of Laplacian perfect state transfer. In this paper, we study the existence of Laplacian perfect pair state transfer in the Q-graph of an $r$-regular graph for $r\ge2$. We prove that the Q-graph of an $r$-regular graph does not have Laplacian perfect pair state transfer when $r+1$ is prime or a power of $2$. We also give a sufficient condition for Q-graph to have Laplacian pretty good pair state transfer.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.