IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v433y2022ics0096300322004684.html
   My bibliography  Save this article

On the rank of the distance matrix of graphs

Author

Listed:
  • Dratman, Ezequiel
  • Grippo, Luciano N.
  • Moyano, Verónica
  • Pastine, Adrián

Abstract

Let G be a connected graph with V(G)={v1,…,vn}. The (i,j)-entry of the distance matrix D(G) of G is the distance between vi and vj. In this article, using the well-known Ramsey’s theorem, we prove that for each integer k≥2, there is a finite amount of graphs whose distance matrices have rank k. We exhibit the list of graphs with distance matrices of rank 2 and 3. Besides, we study the rank of the distance matrices of graphs belonging to a family of graphs with their diameters at most two, the trivially perfect graphs. We show that for each η≥1 there exists a trivially perfect graph with nullity η. We also show that for threshold graphs, which are a subfamily of the family of trivially perfect graphs, the nullity is bounded by one.

Suggested Citation

  • Dratman, Ezequiel & Grippo, Luciano N. & Moyano, Verónica & Pastine, Adrián, 2022. "On the rank of the distance matrix of graphs," Applied Mathematics and Computation, Elsevier, vol. 433(C).
    • Handle: RePEc:eee:apmaco:v:433:y:2022:i:c:s0096300322004684
    DOI: 10.1016/j.amc.2022.127394
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322004684
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127394?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:apmaco:v:433:y:2022:i:c:s0096300322004684. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.