Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
type: Item
instance of: scholarly article
title: Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
zbMATH Open document ID: 1180.05055
author: Emmanuel Charbit
author: Irène Charon
author: Olivier Hudry
author: Gérard Cohen
author: Antoine Lobstein
published in: Advances in Mathematics of Communications
publication date: 2009-02-19T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5509393
zbMATH Keywords: bipartite graphs
zbMATH Keywords: discriminating codes
zbMATH Keywords: identifying codes
zbMATH Keywords: locating-dominating codes
zbMATH Keywords: separating codes
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: amc.2008.2.403
OpenAlex ID: W2078516523
DOI: 10.3934/AMC.2008.2.403
Recommended article: Discriminating codes in bipartite graphs
Recommended article: Discriminating codes in (bipartite) planar graphs
Recommended article: Some combinatorial aspects of constructing bipartite-graph codes
Recommended article: Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
Recommended article: Bounds and extremal graphs for total dominating identifying codes
Recommended article: Constructions of binary codes based on bipartite graphs
Recommended article: Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
Recommended article: Extremal cardinalities for identifying and locating-dominating codes in graphs
Recommended article: Explicit non-malleable codes from bipartite graphs
Recommended article: Q3802605
description: scientific article; zbMATH DE number 5509393