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

Identifying codes in line digraphs

Author

Listed:
  • Balbuena, C.
  • Dalfó, C.
  • Martínez-Barona, B.

Abstract

Given an integer ℓ ≥ 1, a (1, ≤ ℓ)-identifying code in a digraph is a dominating subset C of vertices such that all distinct subsets of vertices of cardinality at most ℓ have distinct closed in-neighborhoods within C. In this paper, we prove that every line digraph of minimum in-degree one does not admit a (1, ≤ ℓ)-identifying code for ℓ ≥ 3. Then we give a characterization so that a line digraph of a digraph different from a directed cycle of length 4 and minimum in-degree one admits a (1, ≤ 2)-identifying code. The identifying number of a digraph D, γ→ID(D), is the minimum size of all the identifying codes of D. We establish for digraphs without digons with both vertices of in-degree one that γ→ID(LD) is lower bounded by the number of arcs of D minus the number of vertices with out-degree at least one. Then we show that γ→ID(LD) attains the equality for a digraph having a 1-factor with minimum in-degree two and without digons with both vertices of in-degree two. We finish by giving an algorithm to construct identifying codes in oriented digraphs with minimum in-degree at least two and minimum out-degree at least one.

Suggested Citation

  • Balbuena, C. & Dalfó, C. & Martínez-Barona, B., 2020. "Identifying codes in line digraphs," Applied Mathematics and Computation, Elsevier, vol. 383(C).
    • Handle: RePEc:eee:apmaco:v:383:y:2020:i:c:s0096300320303210
    DOI: 10.1016/j.amc.2020.125357
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320303210
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125357?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:383:y:2020:i:c:s0096300320303210. 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.