Abstract
Let R be a finite commutative ring with unity, and let $$G = (V, E)$$ be a simple graph. The zero-divisor graph, denoted by $$\Gamma (R)$$ is a simple graph with vertex set as R, and two vertices $$x, y \in R$$ are adjacent in $$\Gamma (R)$$ if and only if $$xy=0$$ . In [5], the authors have studied the Laplacian eigenvalues of the graph $$\Gamma (\mathbb {Z}_{n})$$ and for distinct proper divisors $$d_1, d_2, \cdots , d_k$$ of n, they defined the sets as, $$\mathcal {A}_{d_i} = \{x \in \mathbb {Z}_{n} : (x, n) = d_i\}$$ , where (x, n) denotes the greatest common divisor of x and n. In this paper, we show that the sets $$\mathcal {A}_{d_i}$$ , $$1 \le i \le k$$ are actually orbits of the group action: $$Aut(\Gamma (R)) \times R \longrightarrow R$$ , where $$Aut(\Gamma (R))$$ denotes the automorphism group of $$\Gamma (R)$$ . Our main objective is to determine new classes of threshold graphs, since these graphs play an important role in several applied areas. For a reduced ring R, we prove that $$\Gamma (R)$$ is a connected threshold graph if and only if $$R\cong {F}_{q}$$ or $$R\cong {F}_2 \times {F}_{q}$$ . We provide classes of threshold graphs realized by some classes of local rings. Finally, we characterize all finite commutative rings with unity of which zero-divisor graphs are not threshold.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.