On main eigenvalues of zero-divisor graphs of reduced rings

Abstract

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 s 2 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 s main eigenvalues, and that certain induced bipartite subgraphs also have exactly s main eigenvalues for any positive integer s.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…