Bounds for identifying codes in terms of degree parameters - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2011

Bounds for identifying codes in terms of degree parameters

Résumé

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 $\M(G)$ denotes the minimum size of an identifying code of a graph $G$, it was conjectured by F.~Foucaud, R.~Klasing, A.~Kosowski and A.~Raspaud that if a connected graph $G$ has $n$ vertices and maximum degree~$d$ and admits an identifying code, then $\M(G)\leq n-\tfrac{n}{d}+O(1)$. We use probabilistic tools to show that $\M(G)\leq n-\tfrac{n}{\Theta(d^3)}$ holds. For $d$-regular graphs and further classes of graphs, this bound is improved to $\M(G)\leq n-\tfrac{n}{\Theta(d^{3/2})}$. Moreover, if $G$ is regular and has no vertices sharing the same neighbours, we show that the conjecture holds up to constants, i.e. $\M(G)\leq n-\tfrac{n}{\Theta(d)}$. In the second part, we prove that in any graph $G$ of minimum degree~$\delta$ and girth~5, $\M(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$.
Fichier principal
Vignette du fichier
codesregular.pdf (284.47 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00578230 , version 1 (18-03-2011)
hal-00578230 , version 2 (13-05-2011)
hal-00578230 , version 3 (17-06-2011)
hal-00578230 , version 4 (15-02-2012)
hal-00578230 , version 5 (21-09-2012)

Identifiants

Citer

Florent Foucaud, Guillem Perarnau. Bounds for identifying codes in terms of degree parameters. 2011. ⟨hal-00578230v2⟩
199 Consultations
154 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More