## On the Walks and Bipartite Double Coverings of Graphs with the same Main Eigenspace

*In press*

The main eigenvalues of a graph $G$ are those eigenvalues of the $(0,1)$-adjacency matrix $\mathbf A$ having a corresponding eigenvector not orthogonal to $\mathbf j=(1,\dots,1)$. The CDC of a graph $G$ is the direct product $G\times K_2$ … *Read more*