Abstract
ABSTRACTFor each Boolean graph Bn, it is proved that both Bn and its complement are vertex decomposable. It is also proved that Bn is an unmixed graph, thus it is also Cohen–Macaulay.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
