On the minimum size of an identifying code over all orientations of a graph - Inria - Institut national de recherche en sciences et technologies du numérique
Journal Articles The Electronic Journal of Combinatorics Year : 2018

On the minimum size of an identifying code over all orientations of a graph

Abstract

If G be a graph or a digraph, let id(G) be the minimum size of an identifying code of G if one exists, and id(G) = +∞ otherwise. For a graph G, let idor(G) be the minimum of id(D) overall orientations D of G. We give some lower and upper bounds on idor(G). In particular, we show that idor(G) <= 3/2 id(G) for every graph G. We also show that computing idor(G) is NP-hard, while deciding whether idor(G) <= |V (G)| − k is polynomial-time solvable for every fixed integer k.
Fichier principal
Vignette du fichier
ejc-idor.pdf (336.71 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01765643 , version 1 (13-04-2018)

Identifiers

Cite

Nathann Cohen, Frédéric Havet. On the minimum size of an identifying code over all orientations of a graph. The Electronic Journal of Combinatorics, 2018, 25 (1), pp.#P1.49. ⟨10.37236/7117⟩. ⟨hal-01765643⟩
359 View
201 Download

Altmetric

Share

More