Abstract
For a set X, let 2X be the power set of X. Let BX be the Boolean graph, which is defined on the vertex set 2X \ {X, ?}, with M adjacent to N if M ? N = ?. In this paper, several purely graph-theoretic characterizations are provided for blow-ups of a finite or an infinite Boolean graph (respectively, a preatomic graph). Then the characterizations are used to study co-maximal ideal graphs that are blow-ups of Boolean graphs (pre-atomic graphs, respectively).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
