Matrices with isomorphic diagonal hypergraphs

Let A be an nxn matrix of 0's and 1's with total support. The diagonal hypergraph of A is the hypergraph whose vertices are the positive positions of A and whose edges are the positive diagonals of A. We investigate which nxn matrices with total support have diagonal hypergraphs isomorphic to that of A, and the structure of such isomorphisms.

[1]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[2]  Frank Harary,et al.  Graph Theory , 2016 .

[3]  Richard A. Brualdi The diagonal hypergraph of a matrix (bipartite graph) , 1979, Discret. Math..