Maximum difference about the size of optimal identifying codes in graphs differing by one vertex - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2015

Maximum difference about the size of optimal identifying codes in graphs differing by one vertex

Résumé

Let G=(V,E) be a simple undirected graph. We call any subset C⊆V an identifying code if the sets I(v)={c∈C | {v,c}∈E or v=c } are distinct and non-empty for all vertices v∈V. A graph is called twin-free if there is an identifying code in the graph. The identifying code with minimum size in a twin-free graph G is called the optimal identifying code and the size of such a code is denoted by γ(G). Let GS denote the induced subgraph of G where the vertex set S⊂V is deleted. We provide a tight upper bound for γ(GS)-γ(G) when both graphs are twin-free and |V| is large enough with respect to |S|. Moreover, we prove tight upper bound when G is a bipartite graph and |S|=1.
Fichier principal
Vignette du fichier
dmtcs-17-1-22.pdf (223.48 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01196851 , version 1 (10-09-2015)

Identifiants

Citer

Mikko Pelto. Maximum difference about the size of optimal identifying codes in graphs differing by one vertex. Discrete Mathematics and Theoretical Computer Science, 2015, Vol. 17 no. 1 (1), pp.339--356. ⟨10.46298/dmtcs.2107⟩. ⟨hal-01196851⟩

Collections

TDS-MACS
40 Consultations
705 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More