Identifying codes on directed de Bruijn graphs

DOI10.1016/j.dam.2019.02.005zbMath1411.05099arXiv1412.5842OpenAlexW1949968417WikidataQ128284078 ScholiaQ128284078MaRDI QIDQ2416416

Mikko Pelto, Victoria Horan Goliber, Debra L. Boutin

Publication date: 23 May 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.5842

zbMATH Keywords

dominating setidentifying codesresolving setdetermining setde Bruijn network

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (2)

A comparison of approaches for finding minimum identifying codes on graphs ⋮ On weak metric dimension of digraphs

Uses Software

• Stony Brook

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Identifying graph automorphisms using determining sets
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
• Partial words and a theorem of Fine and Wilf
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• On the metric dimension of line graphs
• On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
• Landmarks in graphs
• The directed distance dimension of oriented graphs
• On a new class of codes for identifying vertices in graphs
• Uniqueness Theorems for Periodic Functions

This page was built for publication: Identifying codes on directed de Bruijn graphs