Spectral properties of Cayley graphs over \(M_{m \times n}(F_q)\) (Q2123311): Difference between revisions

The idea of Cayley graphs is pertinent as it connects distinct areas of mathematics and graph theory with potential for interesting real life applications. The Cayley graph $G(m,n,r)$ connects very well with matrix graphs or bilinear forms graphs. The authors of this paper compute the spectrum of this graph. They transform this task into the one of computing the number of $m\times n$ matrices of rank $r$ satisfying certain conditions. They find a recursion relation for the eigenvalues of $G(m,n,r)$ and derive direct formulae for the eigenvalues of $G(m,n,1)$. As a prelude for their main result, they also establish certain lemmas to find the eigenvalue of $G(m,n,r)$ corresponding to an $m\times n$ matrix over a finite field of order $q$.