dc.contributor.author Balbuena Martínez, Maria Camino Teófila dc.contributor.author Dalfó Simó, Cristina dc.contributor.author Martínez Barona, Berenice dc.contributor.other Universitat Politècnica de Catalunya. Departament d'Enginyeria Civil i Ambiental dc.contributor.other Universitat Politècnica de Catalunya. Doctorat en Matemàtica Aplicada dc.date.accessioned 2020-03-27T11:45:31Z dc.date.available 2020-03-27T11:45:31Z dc.date.issued 2019 dc.identifier.citation Balbuena, C.; Dalfo, C.; Martínez, B. Sufficient conditions for a digraph to admit a (1,=l)-identifying code. "Discussiones mathematicae. Graph theory", 2019. dc.identifier.issn 1234-3099 dc.identifier.uri http://hdl.handle.net/2117/182027 dc.description.abstract A (1, = )-identifying code in a digraph D is a subset C of vertices of D such that all distinct subsets of vertices of cardinality at most  have distinct closed in-neighbourhoods within C. In this paper, we give some sufficient conditions for a digraph of minimum in-degree d - = 1 to admit a (1, = )- identifying code for  ¿ {d -, d- + 1}. As a corollary, we obtain the result by Laihonen that states that a graph of minimum degree d = 2 and girth at least 7 admits a (1, = d)-identifying code. Moreover, we prove that every 1-in-regular digraph has a (1, = 2)-identifying code if and only if the girth of the digraph is at least 5. We also characterize all the 2-in-regular digraphs admitting a (1, = )-identifying code for  ¿ {2, 3}. dc.language.iso eng dc.subject Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria dc.subject.lcsh Graph theory dc.subject.other graph dc.subject.other digraph dc.subject.other identifying code dc.title Sufficient conditions for a digraph to admit a (1,=l)-identifying code dc.type Article dc.subject.lemac Grafs, Teoria de dc.contributor.group Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions dc.identifier.doi 10.7151/dmgt.2218 dc.description.peerreviewed Peer Reviewed dc.subject.ams Classificació AMS::05 Combinatorics::05C Graph theory dc.relation.publisherversion https://www.dmgt.uz.zgora.pl/publish/view_pdf.php?ID=4689 dc.rights.access Open Access local.identifier.drac 24240401 dc.description.version Postprint (author's final draft) dc.relation.projectid info:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECT local.citation.author Balbuena, C.; Dalfo, C.; Martínez, B. local.citation.publicationName Discussiones mathematicae. Graph theory
﻿

### This item appears in the following Collection(s)

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder