Abstract
AbstractThe problem of finding the minimum rank over all symmetric matrices corresponding to a given graph has grown in interest recently. It is well known that the minimum rank of any graph is bounded above by the clique cover number, the minimum number of cliques needed to cover all edges of the graph. We generalize the idea of the clique cover number by defining the rank sum of a cover to be the sum of the minimum ranks of the graphs in the cover. Using this idea we obtain a combinatorial solution to the minimum rank problem for an outerplanar graph. As a consequence the minimum rank of an outerplanar graph is field independent and all outerplanar graphs have a universally optimal matrix. We also consider implications of the main result to the inverse inertia problem.
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.
