Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
2015 ◽
Vol Vol. 17 no. 1
(Graph Theory)
◽
Keyword(s):
Graph Theory International audience 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.
Keyword(s):
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
Keyword(s):
2009 ◽
Vol Vol. 11 no. 2
(Graph and Algorithms)
◽
Keyword(s):
Keyword(s):
2017 ◽
Vol 27
(2)
◽
pp. 274-288
◽
Keyword(s):
2010 ◽
Vol DMTCS Proceedings vol. AM,...
(Proceedings)
◽
Keyword(s):
Keyword(s):
2014 ◽
Vol Vol. 16 no. 3
(Graph Theory)
◽