IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v34y2022i6p2868-2872.html
   My bibliography  Save this article

Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph

Author

Listed:
  • Illya V. Hicks

    (Computational Applied Mathematics & Operations Research Department, Rice University, Houston, Texas 77005)

  • Boris Brimkov

    (Mathematics and Statistics Department, Slippery Rock University, Slippery Rock, Pennsylvania 16057)

  • Louis Deaett

    (Mathematics and Statistics Department Quninnipiac University, Hamden, Connecticut 06518)

  • Ruth Haas

    (Department of Mathematics, University of Hawaii at Monoa, Honolulu, Hawaii 96822)

  • Derek Mikesell

    (Computational Applied Mathematics and Operations Research Department, Rice University, Houston, Texas 77005)

  • David Roberson

    (Department of Applied Mathematics and Computer Science, Technical University of Denmark, 2800 Kgs, Lyngby, Denmark; Centre for the Mathematics of Quantum Theory (QMATH), Department of Mathematical Sciences, University of Copenhagen, Copenhagen 2100, Denmark)

  • Logan Smith

    (Computational Applied Mathematics and Operations Research Department, Rice University, Houston, Texas 77005)

Abstract

The minimum rank of a graph G is the minimum of the ranks of all symmetric adjacency matrices of G. We present a new combinatorial bound for the minimum rank of an arbitrary graph G based on enumerating certain subsets of vertices of G satisfying matroid theoretic properties. We also present some computational and theoretical challenges associated with computing the minimum rank. This includes a conjecture that this bound on the minimum rank actually holds with equality for all graphs.

Suggested Citation

  • Illya V. Hicks & Boris Brimkov & Louis Deaett & Ruth Haas & Derek Mikesell & David Roberson & Logan Smith, 2022. "Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2868-2872, November.
    • Handle: RePEc:inm:orijoc:v:34:y:2022:i:6:p:2868-2872
    DOI: 10.1287/ijoc.2022.1219
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2022.1219
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2022.1219?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orijoc:v:34:y:2022:i:6:p:2868-2872. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.