Abstract
A (0, 1)-matrix M has the consecutive 1's property for columns if the rows of M can be permuted so that the 1's in each column appear consecutively. A graph-theoretic approach is used to characterize matrices with this property in terms of forbidden submatrices. Graphs whose adjacency matrix has this property are also characterized.
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.
