Consider an undirected bipartite graph G=(V=I∪A,E), with no edge inside I nor A. For any vertex v∈V, let N(v) be the set of neighbours of v. A code C⊆A is said to be discriminating if all the sets N(i)∩C,i∈I, are nonempty and distinct. We study some properties of discriminating codes. In particular, we give bounds on the minimum size of these codes, investigate graphs where minimal discriminating
... [Show full abstract] codes have size close to the upper bound, or give the exact minimum size in particular graphs; we also give an NP-completeness result.