Identifying codes in line digraphs

DOI10.1016/J.AMC.2020.125357MaRDI QIDQ2189840zbMATH OpenOpenAlexFDO

Authors C. Dalfó, Berenice Martínez-Barona, C. Balbuena

Publication date 17 June 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.05083, http://hdl.handle.net/2117/172232

zbMATH Keywords

dominating setidentifying codeline digraph1-factorseparating set

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Other types of codes (94B60)

Abstract: Given an integer $ellge1$, a $(1,leell)$-identifying code in a digraph is a dominating subset $C$ of vertices such that all distinct subsets of vertices of cardinality at most $ell$ have distinct closed in-neighbourhood within $C$. In this paper, we prove that every $k$-iterated line digraph of minimum in-degree at least 2 and $kgeq2$, or minimum in-degree at least 3 and $kgeq1$, admits a $(1,leell)$-identifying code with $ellleq2$, and in any case it does not admit a $(1,leell)$-identifying code for $ellgeq3$. Moreover, we find that the identifying number of a line digraph is lower bounded by the size of the original digraph minus its order. Furthermore, this lower bound is attained for oriented graphs of minimum in-degree at least 2.

Recommendations

• Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code
• Characterizing identifying codes from the spectrum of a graph or digraph
• Identifying codes in line graphs
• On the minimum size of an identifying code over all orientations of a graph
• Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets

Cites work

• scientific article; zbMATH DE number 3218572 (Why is no real title available?)
• A linear algorithm for minimum 1-identifying codes in oriented trees
• Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
• Characterizing identifying codes from the spectrum of a graph or digraph
• Connection digraphs and second-order line digraphs
• Identifying and locating-dominating codes: NP-completeness results for directed graphs
• Identifying codes in line graphs
• Line Digraph Iterations and the (d, k) Digraph Problem
• On a new class of codes for identifying vertices in graphs
• On the linegraph of a directed-graph
• Optimal identification of sets of edges using 2-factors

Cited in

(9)

• Identifying codes in line graphs
• Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
• Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code
• Characterizing identifying codes from the spectrum of a graph or digraph
• Partial linear spaces and identifying codes
• On the minimum size of an identifying code over all orientations of a graph
• A linear algorithm for minimum 1-identifying codes in oriented trees
• Identifying codes on directed de Bruijn graphs
• Edge identifying codes

This page was built for publication: Identifying codes in line digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189840)