Abstract
ABSTRACT The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose entry (for ) is nonzero whenever is an edge in G and is zero otherwise. The sum of the minimum rank of a graph and its maximum nullity (similarly defined) is always the number of vertices in G. This article compares the minimum rank with the clique covering number of G and the Boolean rank of its adjacency matrix. It does the same analysis for bipartite graphs. Finally, we investigate the linear operators on the set of graphs on n vertices that preserve the minimum rank.
Sign-in/Register to access full text options 
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.
