Graph transformations and eigenvectors of the Laplacian, signless Laplacian and Adjacency matrices

We study graph transformations and their effects on the eigenvectors of three fundamental graph matrices: the adjacency matrix $A$, the signless Laplacian $Q$, and the Laplacian $L$. We extend the Laplacian eigenvector edge and matching principles introduced by Merris to $Q$ and $A$. We also extend some of the known $L$ graph transformations to $Q$ and $A$ and prove that graphs admitting a common eigenvector $\mathbf{x}$ for $A,L$ and $Q$ are such that vertices corresponding to nonzero components of $\mathbf{x}$ have same degree. Following our previous work for $L$, we investigate bivalent graphs for $A$ and $Q$, that is graphs admitting an eigenvector with all components in $\{-1,1\}$. In particular, for trees, we characterize $Q$-bivalence and establish that $A$-bivalence forces all vertex degrees to be odd.