Abstract
The real positive semidefinite minimum rank of a graph is the minimum rank among all real positive semidefinite matrices that are naturally associated via their zero-nonzero pattern to the given graph. In this paper, we use orthogonal vertex removal and sign patterns to improve the lower bound for the real positive semidefinite minimum rank determined by the OS-number and the positive semidefinite zero forcing number.
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.
