Discriminating codes in (bipartite) planar graphs

Authors:
Irène Charon;Gérard Cohen;Olivier Hudry;Antoine Lobstein
Affiliations:
GET, Télécom Paris, 46, rue Barrault, 75634 Paris Cedex 13, France and CNRS, LTCI UMR 5141, 46, rue Barrault, 75634 Paris Cedex 13, France;GET, Télécom Paris, 46, rue Barrault, 75634 Paris Cedex 13, France and CNRS, LTCI UMR 5141, 46, rue Barrault, 75634 Paris Cedex 13, France;GET, Télécom Paris, 46, rue Barrault, 75634 Paris Cedex 13, France and CNRS, LTCI UMR 5141, 46, rue Barrault, 75634 Paris Cedex 13, France;CNRS, LTCI UMR 5141, 46, rue Barrault, 75634 Paris Cedex 13, France and GET, Télécom Paris, 46, rue Barrault, 75634 Paris Cedex 13, France
Venue:
European Journal of Combinatorics
Year:
2008

Citing 3
Cited 2

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A linear algorithm for minimum 1-identifying codes in oriented trees

Discrete Applied Mathematics
On a new class of codes for identifying vertices in graphs

IEEE Transactions on Information Theory

Links between discriminating and identifying codes in the binary hamming space

AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Watching systems in graphs: An extension of identifying codes

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider a connected undirected bipartite graph G=(V=I@?A,E), with no edges inside I or 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 classes of bipartite graphs, namely trees and, more generally, (bipartite) planar graphs.