Computing the size of zero divisor graphs

Autor: Mukhtar, Aamir, Murtaza, Rashid, Rehman, Shafiq U., Usman, Saima, Baig, Abdul Qudair
Zdroj: Journal of Information & Optimization Sciences; May 2020, Vol. 41 Issue: 4 p855-864, 10p
Abstrakt: AbstractA recent subject of study linking commutative ring theory with graph theory has been the concept of the zero divisor graph of a commutative ring. The zero divisor graph of a commutative ring exhibits a remarkable amount of graphical structure. Let G(R) be the zero divisor graph introduced by Beck [9], whose vertices are the elements of a ring Rsuch that two distinct vertices x, yare adjacent provided that xy = 0. Let Г(R) be the zero divisor graph introduced by Anderson, Livingston [5] whose vertices are the non-zero zero divisors of the ring Rsuch that two distinct vertices x, yare adjacent provided that xy = 0. Here, the authors investigate the size of the graphs G(ℤn), Г(ℤn).
Databáze: Supplemental Index