Affiliation:
1. Shanghai Jiaotong University, Department of Mathematics, Shanghai, China
2. Shanghai Ocean University, College of Information Technology, Shanghai, China
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).
Publisher
National Library of Serbia
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献