Codes identifying sets of vertices in random networks

DOI10.1016/J.DISC.2006.07.041MaRDI QIDQ870971zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Julien Moncel, Miklós Ruszinkó, Cliff Smyth, Alan 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

zbMATH Keywords

random networksvertex-identifying codes

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60)

Recommendations

• scientific article; zbMATH DE number 2081125
• Codes Identifying Vertices in Graphs
• On cages admitting identifying codes
• On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
• Construction of codes identifying sets of vertices

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3173143 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
• Bounds on the length of disjunctive codes
• Families of optimal codes for strong identification
• New versions of Suen's correlation inequality
• Nonrandom binary superimposed codes
• On \(r\)-cover-free families
• On a new class of codes for identifying vertices in graphs
• On the upper bound of the size of the \(r\)-cover-free families
• Paths in graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Two families of optimal identifying codes in binary Hamming spaces

Cited in

(20)

• Constructing codes identifying sets of vertices
• Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code
• Identifying codes of cycles with odd orders
• Codes Identifying Vertices in Graphs
• Almost every \(n\)-vertex graph is determined by its \(3 \log_2n\)-vertex subgraphs
• Identifying codes and searching with balls in graphs
• Identifying path covers in graphs
• Vertex identifying codes for fault isolation in communication networks
• Locating-dominating sets: from graphs to oriented graphs
• On the size of identifying codes in binary hypercubes
• Identifying and locating-dominating codes in (random) geometric networks
• scientific article; zbMATH DE number 7655282 (Why is no real title available?)
• Liar's domination
• Upper bounds for binary identifying codes
• The identifying code number and Mycielski's construction of graphs
• Extension of universal cycles for globally identifying colorings of cycles
• Improved bounds on identifying codes in binary Hamming spaces
• Sequential metric dimension for random graphs
• On the limiting distribution of the metric dimension for random forests
• Watching systems in graphs: an extension of identifying codes

This page was built for publication: Codes identifying sets of vertices in random networks

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