Given a graph, what are some sufficient (and necessary) conditions to tell if its adjacency matrix has the consecutive ones property?
Similar question for its incidence matrix?
Note that a $\{0,1\}$-valued matrix is said to have the consecutive ones property, if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Or the roles of rows and columns can be exchanged in the definition.
Thanks and regards!