Loading...
Loading...

Go to the content (press return)

Sufficient conditions for a digraph to admit a (1,=l)-identifying code

Author
Balbuena, C.; Dalfo, C.; Martínez, B.
Type of activity
Journal article
Journal
Discussiones mathematicae. Graph theory
Date of publication
2019
DOI
10.7151/dmgt.2218
Project funding
Combinatorics of networks and computation
Repository
http://hdl.handle.net/2117/182027 Open in new window
URL
https://www.dmgt.uz.zgora.pl/publish/view_pdf.php?ID=4689 Open in new window
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....
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.
Keywords
digraph, graph, identifying code
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Attachments