Maximum size of a minimum watching system and the graphs achieving the bound
type: Item
instance of: scholarly article
title: Maximum size of a minimum watching system and the graphs achieving the bound
zbMATH Open document ID: 1321.05136
author: David Auger
author: Irène Charon
author: Olivier Hudry
author: Antoine Lobstein
published in: Discrete Applied Mathematics
publication date: 2015-09-22T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 94B60
Mathematics Subject Classification ID: 94B65
zbMATH DE Number: 6484193
zbMATH Keywords: watching systems
zbMATH Keywords: identifying codes
describes a project that uses: OEIS
MaRDI profile type: Publication
full work available at URL: j.dam.2012.08.028
OpenAlex ID: W1991443063
cites work: Watching systems in graphs: an extension of identifying codes
cites work: Extremal cardinalities for identifying and locating-dominating codes in graphs
cites work: Extremal graphs for the identifying code problem
cites work: On graphs having a \(V\setminus \{x\}\) set as an identifying code
cites work: Q5429563
cites work: On a new class of codes for identifying vertices in graphs
cites work: On the identification of vertices using cycles
cites work: Q4774085
cites work: Q4443440
DOI: 10.1016/J.DAM.2012.08.028
description: scientific article; zbMATH DE number 6484193