Codes identifying sets of vertices in random networks
From MaRDI portal
Publication:870971
DOI10.1016/j.disc.2006.07.041zbMath1160.94021OpenAlexW2154298980WikidataQ57401488 ScholiaQ57401488MaRDI QIDQ870971
Julien Moncel, Cliff Smyth, Miklós Ruszinkó, Alan M. Frieze, Ryan R. Martin
Publication date: 15 March 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.041
Random graphs (graph-theoretic aspects) (05C80) Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60)
Related Items (20)
Constructing codes identifying sets of vertices ⋮ Identifying path covers in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Watching systems in graphs: an extension of identifying codes ⋮ Identifying codes of cycles with odd orders ⋮ Identifying and Locating–Dominating Codes in (Random) Geometric Networks ⋮ Extension of universal cycles for globally identifying colorings of cycles ⋮ Improved bounds on identifying codes in binary Hamming spaces ⋮ The identifying code number and Mycielski's construction of graphs ⋮ Liar's domination ⋮ Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code ⋮ Upper bounds for binary identifying codes ⋮ On the size of identifying codes in binary hypercubes ⋮ Locating-dominating sets: from graphs to oriented graphs ⋮ Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs ⋮ Sequential metric dimension for random graphs ⋮ Codes Identifying Vertices in Graphs ⋮ On the limiting distribution of the metric dimension for random forests ⋮ Identifying codes and searching with balls in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on the length of disjunctive codes
- On the upper bound of the size of the \(r\)-cover-free families
- Families of optimal codes for strong identification
- On \(r\)-cover-free families
- A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
- On a new class of codes for identifying vertices in graphs
- Two families of optimal identifying codes in binary Hamming spaces
- New versions of Suen's correlation inequality
- Paths in graphs
- Nonrandom binary superimposed codes
This page was built for publication: Codes identifying sets of vertices in random networks
