Bounds for identifying codes in terms of degree parameters

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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

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

Review text

Summary: An identifying code is a subset of vertices of a graph such that each vertex is uniquely determined by its neighbourhood within the identifying code. If \(\gamma^{\text{ID}}(G)\) denotes the minimum size of an identifying code of a graph \(G\), it was conjectured by \textit{F. Foucaud}, \textit{R. Klasing}, \textit{A. Kosowski} and \textit{A. Raspaud} [``On the size of identifying codes in triange-free graphs (submitted to publication)] that there exists a constant \(c\) such that if a connected graph \(G\) with \(n\) vertices and maximum degree \(d\) admits an identifying code, then \(\gamma^{\text{ID}}(G)\leq n-\tfrac{n}{d}+c\). We use probabilistic tools to show that for any \(d\geq 3, \gamma^{\text{ID}}(G)\leq n-\tfrac{n}{\Theta(d)}\) holds for a large class of graphs containing, among others, all regular graphs and all graphs of bounded clique number. This settles the conjecture (up to constants) for these classes of graphs. In the general case, we prove \(\gamma^{\text{ID}}(G)\leq n-\tfrac{n}{\Theta(d^{3})}\). In a second part, we prove that in any graph \(G\) of minimum degree \(\delta\) and girth at least 5, \(\gamma^{\text{ID}}(G)\leq(1+o_\delta(1))\tfrac{3\log\delta}{2\delta}n\). Using the former result, we give sharp estimates for the size of the minimum identifying code of random \(d\)-regular graphs, which is about \(\tfrac{\log d}{d}n\).

Recommendations

Cited in

(23)

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

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