Search arXivSearch

arXiv · 2512.13595

Laplacian Spectrum of cozero-divisor graphs of commutative polynomial rings

Abstract

The cozero-divisor graph of a commutative ring $R$, denoted $Γ'(R)$, is the graph whose vertices are the non-zero and non-unit elements of $R$, with two distinct vertices $x$ and $y$ adjacent if and only if $x \notin Ry$ and $y \notin Rx$. This paper studies the structural properties of $Γ'(R)$ for the polynomial ring $R = \Z_n[x]/(x^2)$, where $n$ has the prime power decomposition of $p_1^{a_1}p_2^{a_2}\cdots p_q^{a_q}$. We provide a complete structure of the cozero-divisor graph for all $n$ up to cubic prime power decompositions. Furthermore, we determine the Laplacian spectrum of these graphs. Finally, we discuss the connectivity of such a cozero-divisor graph of the polynomial rings for any $n$. Our work provides the first comprehensive spectral analysis of cozero-divisor graphs for non-local polynomial rings and establishes powerful new techniques for bridging commutative algebra with spectral graph theory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sarbari Mitra, Soumya Bhoumik. 2025-12-15. Laplacian Spectrum of cozero-divisor graphs of commutative polynomial rings. https://arxiv.org/abs/2512.13595

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO