Work

Some Results on Annihilating-ideal Graphs

Year: 2016
Type: article
Abstract: The annihilating-ideal graph of a commutative ring R, denoted by ๐”ธ๐”พ(R), is a graph whose vertex set consists of all non-zero annihilating ideals and two distinct vertices I and J are adjacent if and only if IJ = (0). Here we show that if R is a reduced ring and the independence number of ๐”ธ๐”พ(R) is finite, then the edge chromatic number of ๐”ธ๐”พ(R) equals its maximum degree and this number equals 2|Min(R)|โˆ’1 also, it is proved that the independence number of ๐”ธ๐”พ(R) equals 2|Min(R)|โˆ’1, where Min(R) denotes the set of minimal prime ideals of R. Then we give some criteria for a graph to be isomorphic with an annihilating-ideal graph of a ring. For example, it is shown that every bipartite annihilating-ideal graph is a complete bipartite graph with at most two horns. Among other results, it is shown that a รปnite graph ๐”ธ๐”พ(R) is not Eulerian, and that it is Hamiltonian if and only if R contains no Gorenstain ring as its direct summand.
Institution: Razi University
Language: English
Open Access status: bronze
OpenAlex ID: W2531842724
FWCI:
Cites: 18
Cited by: 5
Related to: 10