Abstract
In this note we investigate pairs of graphs that can be realized as the row-orthogonal and column-orthogonal graphs of a square (0,1)-matrix, and graphs that can be realized as the row- and column-orthogonal graph of a symmetric (0,1)-matrix. We provide a general construction that shows, in particular, that trees, and all bipartite graphs with a vertex of degree 1 or of diameter at least 9 have such a symmetric realization.
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
