Abstract:In the regular three-eigenvalue setting, spectral complexity and coherent-algebraic complexity coincide: a connected regular graph has exactly three distinct eigenvalues if and only if it is strongly regular, its coherent rank is three. Although examples of regular graphs with four distinct eigenvalues and coherent rank larger than four are known, it was unknown whether coherent rank is uniformly bounded among regular graphs with four distinct eigenvalues. We show that no such bound exists, even under the additional assumption of co-edge-regularity. For every prime power \(q\), we construct infinitely many co-edge-regular graphs with exactly four distinct eigenvalues, smallest eigenvalue \(-2q-1\), and coherent rank at least \(q+4\). Consequently, coherent rank is unbounded among co-edge-regular graphs with exactly four distinct eigenvalues.
From: Hong-Jun Ge [view email]
[v1]
Thu, 18 Jun 2026 09:23:28 UTC (25 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。