On rings whose annihilating-ideal graphs are blow-ups of a class of Boolean graphs
Sign Up to like & getrecommendations! Published in 2017 at "Journal of The Korean Mathematical Society"
DOI: 10.4134/jkms.j160283
Abstract: For a finite or an infinite set X, let 2 be the power set of X. A class of simple graph, called strong Boolean graph, is defined on the vertex set 2 \ {X, ∅},… read more here.
Keywords: graphs; annihilating ideal; graph; strong boolean ... See more keywords