Graph products that allow two distinct eigenvalues

Abstract

The parameter $q(G)$ of a graph $G$ is the minimum number of distinct eigenvalues of a symmetric matrix whose pattern is given by $G$. We introduce a novel graph product by which we construct new infinite families of graphs that achieve $q(G)=2$. Several graph families for which it is already known that $q(G)=2$ can also be thought of as arising from this new product