Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues
Abstract
We determine connected bipartite regular graphs with four distinct adjacency eigenvalues that induce periodic Grover walks, and show that it is only C6. We also show that there are only three kinds of the second largest eigenvalues of bipartite regular periodic graphs with five distinct eigenvalues. Using walk-regularity, we enumerate feasible spectra for such graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.