Bounds for identifying codes in terms of degree parameters

zbMath1243.05184MaRDI QIDQ426794

Florent Foucaud, Guillem Perarnau

Publication date: 12 June 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p32

zbMATH Keywords

size of the minimum identifying code of random \(d\)-regular graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Probability theory on algebraic and topological structures (60B99)

Related Items (12)

Revisiting and Improving Upper Bounds for Identifying Codes ⋮ Bounds and extremal graphs for total dominating identifying codes ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes ⋮ On the size of identifying codes in triangle-free graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bounds on the identifying codes in trees ⋮ Strong identification codes for graphs ⋮ Locating-Domination and Identification ⋮ Locating-dominating sets and identifying codes in graphs of girth at least 5 ⋮ On the limiting distribution of the metric dimension for random forests ⋮ Identifying codes and searching with balls in graphs

This page was built for publication: Bounds for identifying codes in terms of degree parameters