IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i23p3657-d1527171.html
   My bibliography  Save this article

Cyclic Structure, Vertex Degree and Number of Linear Vertices in Minimal Strong Digraphs

Author

Listed:
  • Miguel Arcos-Argudo

    (Math Innovation Group, Universidad Politécnica Salesiana, Cuenca 010102, Ecuador
    These authors contributed equally to this work.)

  • Jesús Lacalle

    (Departmento de MATIC, ETSI Sistemas Informáticos, Universidad Politécnica de Madrid, 28031 Madrid, Spain
    These authors contributed equally to this work.)

  • Luis M. Pozo-Coronado

    (Departmento de MATIC, ETSI Sistemas Informáticos, Universidad Politécnica de Madrid, 28031 Madrid, Spain
    These authors contributed equally to this work.)

Abstract

Minimal Strong Digraphs (MSDs) can be regarded as a generalization of the concept of tree to directed graphs. Their cyclic structure and some spectral properties have been studied in several articles. In this work, we further study some properties of MSDs that have to do with bounding the length of the longest cycle (regarding the number of linear vertices, or the maximal in- or outdegree of vertices); studying whatever consequences from the spectral point of view; and giving some insight about the circumstances in which an efficient algorithm to find the longest cycle contained in an MSD can be formulated. Among other properties, we show that the number of linear vertices contained in an MSD is greater than or equal to the maximal (respectively minimal) in- or outdegree of any vertex of the MSD and that the maximal length of a cycle contained in an MSD is lesser than or equal to 2 n − m where n , m are the order and the size of the MSD, respectively; we find a bound for the coefficients of the characteristic polynomial of an MSD, and finally, we prove that computing the longest cycle contained in an MSD is an NP-hard problem.

Suggested Citation

  • Miguel Arcos-Argudo & Jesús Lacalle & Luis M. Pozo-Coronado, 2024. "Cyclic Structure, Vertex Degree and Number of Linear Vertices in Minimal Strong Digraphs," Mathematics, MDPI, vol. 12(23), pages 1-11, November.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:23:p:3657-:d:1527171
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/23/3657/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/23/3657/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:12:y:2024:i:23:p:3657-:d:1527171. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.