Identifying codes and watching systems in Kneser graphs
From MaRDI portal
Recommendations
Cites work
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Extremal graphs for the identifying code problem
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- Identifying codes in line graphs
- Minimal identifying codes in trees and planar graphs with large girth
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- On a new class of codes for identifying vertices in graphs
- On the size of identifying codes in triangle-free graphs
- Watching systems in graphs: an extension of identifying codes
- Watching systems of triangular graphs
Cited in
(12)- On the watching number of graphs using discharging procedure
- The watching system as a generalization of identifying code
- New results of identifying codes in product graphs
- Watching systems in the King grid
- Watching systems in graphs: an extension of identifying codes
- Minimum identifying codes in some graphs differing by matchings
- Maximum size of a minimum watching system and the graphs achieving the bound
- Watching systems of triangular graphs
- On the watching number of graphs
- Progress on fault-tolerant locating-dominating sets
- Proof of a conjecture for the identifying codenumber of the subdivision of graphs
- Domination number and watching number of subdivision construction of graphs
This page was built for publication: Identifying codes and watching systems in Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2966507)
