Abstract
An m<TEX>${\times}$</TEX>n Boolean matrix A is called regular if there exists an n<TEX>${\times}$</TEX>m Boolean matrix X such that AXA = A. We have characterizations of Boolean regular matrices. We also determine the linear operators that strongly preserve Boolean regular matrices.
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
