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

Distance ideals of digraphs

Author

Listed:
  • Alfaro, Carlos A.
  • Hoekstra-Mendoza, Teresa I.
  • Serrano, Juan Pablo
  • Villagrán, Ralihe R.

Abstract

We focus on strongly connected, strong for short, digraphs since in this setting distance is defined for every pair of vertices. Distance ideals generalize the spectrum and Smith normal form of several distance matrices associated with strong digraphs. We introduce the concept of pattern which allow us to characterize the family Γ1 of digraphs with only one trivial distance ideal over Z. This result generalizes an analogous result for undirected graphs that states that connected graphs with one trivial ideal over Z consists of either complete graphs or complete bipartite graphs. It turns out that the strong digraphs in Γ1 consists in the circuit with 3 vertices and a family Λ of strong digraphs that contains complete graphs and complete bipartite graphs, regarded as digraphs. We also compute all distance ideals of some strong digraphs in the family Λ. Then, we explore the distance ideals of circuits, which turns out to be an infinite family of digraphs with unbounded diameter in Γ2, that is, digraphs with two trivial distance ideals.

Suggested Citation

  • Alfaro, Carlos A. & Hoekstra-Mendoza, Teresa I. & Serrano, Juan Pablo & Villagrán, Ralihe R., 2025. "Distance ideals of digraphs," Applied Mathematics and Computation, Elsevier, vol. 500(C).
    • Handle: RePEc:eee:apmaco:v:500:y:2025:i:c:s0096300325001572
    DOI: 10.1016/j.amc.2025.129430
    as

    Download full text from publisher

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

    More about this item

    Statistics

    Access and download statistics

    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:500:y:2025:i:c:s0096300325001572. 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.