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

On the Packing Partitioning Problem on Directed Graphs

Author

Listed:
  • Babak Samadi

    (Department of Mathematics, Faculty of Mathematical Sciences, Alzahra University, Tehran 1993893973, Iran)

  • Ismael G. Yero

    (Departamento de Matemáticas, Universidad de Cádiz, 11202 Algeciras, Spain)

Abstract

This work is aimed to continue studying the packing sets of digraphs via the perspective of partitioning the vertex set of a digraph into packing sets (which can be interpreted as a type of vertex coloring of digraphs) and focused on finding the minimum cardinality among all packing partitions for a given digraph D , called the packing partition number of D . Some lower and upper bounds on this parameter are proven, and their exact values for directed trees are given in this paper. In the case of directed trees, the proof results in a polynomial-time algorithm for finding a packing partition of minimum cardinality. We also consider this parameter in digraph products. In particular, a complete solution to this case is presented when dealing with the rooted products.

Suggested Citation

  • Babak Samadi & Ismael G. Yero, 2021. "On the Packing Partitioning Problem on Directed Graphs," Mathematics, MDPI, vol. 9(23), pages 1-12, December.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:23:p:3148-:d:696353
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/23/3148/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/23/3148/
    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:9:y:2021:i:23:p:3148-:d:696353. 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.