Fault tolerant detectors for distinguishing sets in graphs
type: Item
instance of: scholarly article
title: Fault tolerant detectors for distinguishing sets in graphs
zbMATH Open document ID: 1327.05266
author: Suk J. Seo
author: Peter Slater
publication date: 2015-11-17T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6509489
zbMATH Keywords: distinguishing sets
zbMATH Keywords: fault tolerant detectors
zbMATH Keywords: redundant distinguishing open-locating-dominating set
zbMATH Keywords: detection distinguishing open-locating-dominating set
MaRDI profile type: Publication
full work available at URL: dmgt.1838
OpenAlex ID: W2578057204
cites work: Exact Minimum Density of Codes Identifying Vertices in the Square Grid
cites work: Identifying and locating-dominating codes on chains and cycles
cites work: Q3089301
cites work: Q5442540
cites work: On open neighborhood locating-dominating in graphs
cites work: Bounds for codes identifying vertices in the hexagonal grid
cites work: New bounds on the minimum density of an identifying code for the infinite hexagonal grid
cites work: Q3090475
cites work: Centroidal bases in graphs
cites work: Q3032297
cites work: Q4119237
cites work: Liar's domination in ladders
cites work: Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
cites work: Nordhaus-Gaddum bounds for locating domination
cites work: Q5506519
cites work: An optimal locating-dominating set in the infinite triangular grid
cites work: An optimal strongly identifying code in the infinite triangular grid
cites work: On locating--dominating sets in infinite grids
cites work: On identifying codes that are robust against edge changes
cites work: On strongly identifying codes
cites work: On a new class of codes for identifying vertices in graphs
cites work: Optimal open-locating-dominating sets in infinite triangular grids
cites work: On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
cites work: A linear time algorithm for liar's domination problem in proper interval graphs
cites work: Hardness results and approximation algorithm for total liar's domination in graphs
cites work: Q3616664
cites work: Liar's domination in graphs
cites work: Q3581950
cites work: Q3565861
cites work: Open neighborhood locating-dominating in trees
cites work: Open neighborhood locating-domination for grid-like graphs
cites work: Graphical parameters for classes of tumbling block graphs
cites work: Q5405452
cites work: OLD trees with maximum degree three
cites work: Q4566243
cites work: Q4075485
cites work: Domination and location in acyclic graphs
cites work: Q3803159
cites work: Q4871068
cites work: Fault-tolerant locating-dominating sets
cites work: Liar's domination
DOI: 10.7151/DMGT.1838
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 6509489