Bounding the multiplicities of eigenvalues of graph matrices in terms of circuit rank using a new approach

Ahmet Batal

Let $G$ be a simple undirected graph, $\theta (G)$ be the circuit rank of $G$, ${\eta }_M(G)$ and $m_M(G,\lambda )$ be the nullity and the multiplicity of eigenvalue $\lambda$ of a graph matrix $M(G)$, res…