Back to Search Start Over

The zero-divisor associate graph over a finite commutative ring.

Authors :
Biswas, Bijon
Gupta, Raibatak Sen
Sen, Mridul Kanti
Kar, Sukhendu
Source :
Communications in Combinatorics & Optimization; Mar2025, Vol. 10 Issue 1, p232-243, 12p
Publication Year :
2025

Abstract

In this paper, we introduce the zero-divisor associate graph Γ<subscript>D</subscript>(R) over a finite commutative ring R. It is a simple undirected graph whose vertex set consists of all non-zero elements of R, and two vertices a, b are adjacent if and only if there exist non-zero zero-divisors z<subscript>1</subscript>, z<subscript>2</subscript> in R such that az<subscript>1</subscript> = bz<subscript>2</subscript>. We determine the necessary and sufficient conditions for connectedness and completeness of Γ<subscript>D</subscript>(R) for a unitary commutative ring R. The chromatic number of Γ<subscript>D</subscript>(R) is also studied. Next, we characterize the rings R for which Γ<subscript>D</subscript>(R) becomes a line graph of some graph. Finally, we give the complete list of graphs with at most 15 vertices which are realizable as Γ<subscript>D</subscript>(R), characterizing the associated ring R in each case. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
25382128
Volume :
10
Issue :
1
Database :
Complementary Index
Journal :
Communications in Combinatorics & Optimization
Publication Type :
Academic Journal
Accession number :
180958413
Full Text :
https://doi.org/10.22049/cco.2023.28488.1577