The problem of characterizing graphs with a prescribed number of main eigenvalues is a long-standing problem in spectral graph theory. Although some constructions are known, only a few produce infinite families of simple connected graphs with exactly main eigenvalues. Zero-divisor graphs form a well-structured class of algebraic graphs whose spectra can be described explicitly using equitable partitions, making them a convenient setting to study main eigenvalues. In this paper, we prove that the zero-divisor graphs of reduced rings provide an infinite family of simple connected graphs with exactly main eigenvalues, and that certain induced bipartite subgraphs also have exactly main eigenvalues for any positive integer .

生成讲解博客的中文版本

生成AI智能校验的中文版本